Karl Popper's Philosophy of Science - And the Evolution of the Popperian Worlds

This doctoral thesis in theoretical philosophy is a systematic analysis of Karl Popper's philosophy of science and its relation to his theory of three worlds. The general aim is to study Popper's philosophy of science and to show that Popper's theory of three worlds was a restatement of his earlier positions. As a result, a new reading of Popper's philosophy and development is offered and the theory of three worlds is analysed in a new manner. It is suggested that the theory of three worlds is not purely an ontological theory, but has a profound epistemological motivation. In Part One, Popper's epistemology and philosophy of science is analysed. It is claimed that Popper's thinking was bifurcated: he held two profound positions without noticing the tension between them. Popper adopted the position called the theorist around 1930 and focused on the logical structure of scientific theories. In Logik der Forschung (1935), he attempted to build a logic of science on the grounds that scientific theories may be regarded as universal statements which are not verifiable but can be falsified. Later, Popper emphasized another position, called here the processionalist. Popper focused on the study of science as a process and held that a) philosophy of science should study the growth of knowledge and that b) all cognitive processes are constitutive. Moreover, the constitutive idea that we see the world in the searchlight of our theories was combined with the biological insight that knowledge grows by trial and error. In Part Two, the theory of three worlds is analysed systematically. The theory is discussed as a cluster of theories which originate from Popper's attempt to solve some internal problems in his thinking. Popper adhered to realism and wished to reconcile the theorist and the processionalist. He also stressed the real and active nature of the human mind, and the possibility of objective knowledge. Finally, he wished to create a scientific world view.

On Games on Non-Wellfounded Sets and Stationary Sets

In this thesis we study a few games related to non-wellfounded and stationary sets. Games have turned out to be an important tool in mathematical logic ranging from semantic games defining the truth of a sentence in a given logic to for example games on real numbers whose determinacies have important effects on the consistency of certain large cardinal assumptions. The equality of non-wellfounded sets can be determined by a so called bisimulation game already used to identify processes in theoretical computer science and possible world models for modal logic. Here we present a game to classify non-wellfounded sets according to their branching structure. We also study games on stationary sets moving back to classical wellfounded set theory. We also describe a way to approximate non-wellfounded sets with hereditarily finite wellfounded sets. The framework used to do this is domain theory. In the Banach-Mazur game, also called the ideal game, the players play a descending sequence of stationary sets and the second player tries to keep their intersection stationary. The game is connected to precipitousness of the corresponding ideal. In the pressing down game first player plays regressive functions defined on stationary sets and the second player responds with a stationary set where the function is constant trying to keep the intersection stationary. This game has applications in model theory to the determinacy of the Ehrenfeucht-Fraisse game. We show that it is consistent that these games are not equivalent.

Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata

There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer’s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.