Online research in philosophy

We investigate small theories of Boolean ordered o-minimal structures. We prove that such theories are $\aleph_{0}-categorical$ . We give a complete characterization of their models up to bi-interpretability of the language. We investigate types over finite sets, formulas and the notions of definable and algebraic closure.

Frege?s project has been characterized as an attempt to formulate a complete system of logic adequate to characterize mathematical theories such as arithmetic and set theory. As such, it was seen to fail by Gödel?s incompleteness theorem of 1931. It is argued, however, that this is to impose a later interpretation on the word ?complete? it is clear from Dedekind?s writings that at least as good as interpretation of completeness is categoricity. Whereas few interesting first-order mathematical theories are categorical or complete, there are logical extensions of these theories into second-order and by the addition of generalized quantifiers which are categorical. Frege?s project really found success through Gödel?s completeness theorem of 1930 and the subsequent development of first- and higher-order model theory.

In this paper we investigate the connections between categoricity and ranks. We use stability theory to prove some old and new results.

In this paper, I explore some of the motivations behind John Martin Fischer’s semi-compatibilism. Particularly, I look at three reasons Fischer gives for preferring semi-compatibilism to libertarianism. I argue that the first two of these motivations are in tension with each other: the more one is moved by the first motivation, the less one can appeal to the second, and vice versa. I then argue that Fischer’s third motivation ought not move anyone to prefer Fischer’s semi-compatibilist picture to any of the leading contemporary libertarian theories. Finally, I make some methodological comments about the role intuitions play in Fischer’s project.

For each $n > 0$ , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are synonymous in the sense of deBouvere. It is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are synonymous with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories.

This paper is primarily concerned with ℵ 0 -categoricity of theories of partially ordered sets. It contains some general conjectures, a collection of known results and some new theorems on ℵ 0 -categoricity. Among the latter are the following. Corollary 3.3. For every countable ℵ 0 -categorical U there is a linear order of A such that $(\mathfrak{U}, is ℵ 0 -categorical. Corollary 6.7. Every ℵ 0 -categorical theory of a partially ordered set of finite width has a decidable theory. Theorem 7.7. Every ℵ 0 -categorical theory of reticles has a decidable theory. There is a section dealing just with decidability of partially ordered sets, the main result of this section being. Theorem 8.2. If $(P, is a finite partially ordered set and K P is the class of partially ordered sets which do not embed $(P, , then Th(K P ) is decidable iff K P contains only reticles.

In this paper, semi-Post algebras are introduced and investigated. The generalized Post algebras are subcases of semi-Post algebras. The so called primitive Post constants constitute an arbitrary partially ordered set, not necessarily connected as in the case of the generalized Post algebras examined in [3]. By this generalization, semi-Post products can be defined. It is also shown that the class of all semi-Post algebras is closed under these products and that every semi-Post algebra is a semi-Post product of some generalized Post algebras.

We examine two-cardinal problems for the class of O-minimal theories. We prove that an O-minimal theory which admits some (κ, λ) must admit every (κ , λ ). We also prove that every “reasonable” variant of Chang’s Conjecture is true for O-minimal structures. Finally, we generalize these results from the two-cardinal case to the δ-cardinal case for arbitrary ordinals δ.

Structure is central to the realist view of mathematical disciplines with intended interpretations and categoricity is a model-theoretic notion that captures the idea of the determination of structure by theory. By considering the cases of arithmetic and (pure) set theory, I investigate how categoricity results might offer support from within to the realist view. I argue, amongst other things, that second-order quantification is essential to the support the categoricity results provide. I also note how the findings on categoricity relate to a fundamental feature of the realist position.

Semi-Post algebras have been introduced and investigated in [6]. This paper is devoted to semi-Post subalgebras and homomorphisms. Characterization of semi-Post subalgebras and homomorphisms, relationships between subalgebras and homomorphisms of semi-Post algebras and of generalized Post algebras are examined.