We present an axiomatic framework for semantics that can be applied to natural and formal languages. Our main goal is to suggest a very simple mathematical model that describes fundamental cognitive aspects of the human brain and that can still be applied to artificial intelligence. One of our main results is a theorem that allows us to infer syntactical properties of a language out of its corresponding semantics. The role of pragmatics in semantics in our mathematical framework is also discussed.

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable set functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.

We present a semantic proof of Löb's theorem for theories T containing ZF. Without using the diagonalization lemma, we construct a sentence AUT T, which says intuitively that the predicate autological with respect to T (i.e. applying to itself in every model of T) is itself autological with respect to T. In effect, the sentence AUT T states I follow semantically from T. Then we show that this sentence indeed follows from T and therefore is true.

This is the first in a series of papers on Predicative Algebraic Set Theory, where we lay the necessary groundwork for the subsequent parts, one on realizability [B. van den Berg, I. Moerdijk, Aspects of predicative algebraic set theory II: Realizability, Theoret. Comput. Sci. . Available from: arXiv:0801.2305, 2008], and the other on sheaves [B. van den Berg, I. Moerdijk, Aspects of predicative algebraic set theory III: Sheaf models, 2008 ]. We introduce the notion of a predicative category with small (...) maps and show that it provides a sound and complete semantics for constructive set theories like IZF and CZF. The main technical contribution of this paper is that it shows in detail that such categories can always be conservatively embedded in categories that are exact. These exactness properties play a crucial rôle in showing that predicative categories with small maps contain models of set theory and that they are closed under sheaves and realizability. We will prove the former statement in this paper as well, leaving a proof of the closure properties to the papers on realizability and sheaves as mentioned above. (shrink)

This paper was referred to in the Introduction in our paper [Fr97a], “The Axiomatization of Set Theory by Separation, Reducibility, and Comprehension.” In [Fr97a], all systems considered used the axiom of Extensionality. This is appropriate in a set theoretic context.

What is predicativity? While the term suggests that there is a single idea involved, what the history will show is that there are a number of ideas of predicativity which may lead to different logical analyses, and I shall uncover these only gradually. A central question will then be what, if anything, unifies them. Though early discussions are often muddy on the concepts and their employment, in a number of important respects they set the stage for the further developments, and (...) so I shall give them special attention. NB. Ahistorically, modern logical and set-theoretical notation will be used throughout, as long as it does not conflict with original intentions. (shrink)

$${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets of all (...) the sentences that can jointly be valued as true we introduced the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enabled us to characterize referential contradictions, i.e., sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke-style fixed-point characterization of groundedness was offered, and complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) fixed points were put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of $$\mathcal{F}$$ -systems. We showed the relation between local conglomerates and admissible sets of arguments and argued about the usefulness of the concept for the argumentation theory. (shrink)

My thesis consists of three self-contained but interconnected papers. In the first one, 'Word and Objects', I assume that it is possible to quantify over absolutely everything, and show that certain English sentences containing collective predicates resist paraphrase in first-order languages and even in first-order languages enriched with plural quantifiers. To capture such sentences I develop a language containing plural predicates . ;The introduction of plural predicates leads to an extension of Quine's criterion of ontological commitment. I (...) argue that theories containing plural predicates can have plural ontological commitments in addition to singular ones. In this sense, I argue that the subject-matter of ontology is richer than one might have thought. ;Plural predicates turn out to be tremendously fruitful. For example, they provide us with natural formalizations for English plural definite descriptions and generalized quantifiers. They also allow us to state important set theoretic propositions, and give a formal semantics for second-order languages. Such a formal semantics is developed in the second paper, 'Toward a Theory of Second-Order Consequence', which is a collaboration with Gabriel Uzquiano. ;In the third paper, 'Frege's Unofficial Arithmetic', I consider an application of plural predicates to the philosophy of mathematics. By developing a suggestion of the later Frege, I show that any arithmetical predicate can be transformed into a plural predicate in such a way that the arithmetical predicate is true of the number of the Fs just in case the plural predicate is true of the Fs themselves. ;The transformation is important both because it can be put to use by nominalists about arithmetic and neo-Fregeans, and because it provides the foundations for an account of applied arithmetic. (shrink)

Instead of the half-century old foundational feud between set theory and category theory, this paper argues that they are theories about two different complementary types of universals. The set-theoretic antinomies forced naïve set theory to be reformulated using some iterative notion of a set so that a set would always have higher type or rank than its members. Then the universal u_{F}={x|F(x)} for a property F() could never be self-predicative in the sense of u_{F}∈u_{F}. But the mathematical theory of (...) categories, dating from the mid-twentieth century, includes a theory of always-self-predicative universals--which can be seen as forming the "other bookend" to the never-self-predicative universals of set theory. The self-predicative universals of category theory show that the problem in the antinomies was not self-predication per se, but negated self-predication. They also provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. (shrink)

The focus in this essay will be upon the paradoxes, and foremostly in set theory. A central result is that the librationist set theory £ extension \Pfund $\mathscr{HR}(\mathbf{D})$ of \pounds \ accounts for \textbf{Neumann-Bernays-Gödel} set theory with the \textbf{Axiom of Choice} and \textbf{Tarski's Axiom}. Moreover, \Pfund \ succeeds with defining an impredicative manifestation set $\mathbf{W}$, \emph{die Welt}, so that \Pfund$\mathscr{H}(\mathbf{W})$ %is a model accounts for Quine's \textbf{New Foundations}. Nevertheless, the points of view developed support the view that the truth-paradoxes and (...) the set-paradoxes have common origins, so that the librationist resolutions of the set theoretic paradoxes are at the same time resolutions of the truth theoretic paradoxes. Both the librationist resolutions of the set theoretic paradoxes and the truth theoretic paradoxes have non-trivial philosophical implications: librationist set theories have the consequence that there are no absolutely uncountable sets, and librationist truth theories allow the use of syntactical modalities in ways which circumvent limitations as those of \parencite{Montague1963}, and a truth predicate which is useful for more precise philosophical discourse. (shrink)

For the modern set theorist the empty set Ø, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building locks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and Choice (...) are broached in the formal elaboration of the ‘set of’f {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as amotif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski's recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all. (shrink)

Both the constructive and predicative approaches to mathematics arose during the period of what was felt to be a foundational crisis in the early part of this century. Each critiqued an essential logical aspect of classical mathematics, namely concerning the unrestricted use of the law of excluded middle on the one hand, and of apparently circular \impredicative" de nitions on the other. But the positive redevelopment of mathematics along constructive, resp. predicative grounds did not emerge as really viable alternatives to (...) classical, set-theoretically based mathematics until the 1960s. Now we have a massive amount of information, to which this lecture will constitute an introduction, about what can be done by what means, and about the theoretical interrelationships between various formal systems for constructive, predicative and classical analysis. (shrink)

Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...) computer scientists interested in developing very simple computer languages rich enough for mathematical and scientific applications. The authors show that set theory and number theory can be developed within the framework of a new, different, and simple equational formalism, closely related to the formalism of the theory of relation algebras. There are no variables, quantifiers, or sentential connectives. Predicates are constructed from two atomic binary predicates (which denote the relations of identity and set-theoretic membership) by repeated applications of four operators that are analogues of the well-known operations of relative product, conversion, Boolean addition, and complementation. All mathematical statements are expressed as equations between predicates. There are ten logical axiom schemata and just one rule of inference: the one of replacing equals by equals, familiar from high school algebra. Though such a simple formalism may appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics. The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; first-order logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic. (shrink)

This paper shows how the universals of category theory in mathematics provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. The paper also shows how the always-self-predicative universals of category theory provide the "opposite bookend" to the never-self-predicative universals of iterative set theory and thus that the paradoxes arose from having (...) one theory (e.g., Frege's Paradise) where universals could be either self-predicative or non-self-predicative (instead of being always one or always the other). (shrink)

Introduction. The system of axioms for set theory to be exhibited in this paper is a modification of the axiom system due to von Neumann. In particular it adopts the principal idea of von Neumann, that the elimination of the undefined notion of a property (“definite Eigenschaft”), which occurs in the original axiom system of Zermelo, can be accomplished in such a way as to make the resulting axiom system elementary, in the sense of being formalizable in the logical calculus (...) of first order, which contains no other bound variables than individual variables and no accessory rule of inference (as, for instance, a scheme of complete induction).The purpose of modifying the von Neumann system is to remain nearer to the structure of the original Zermelo system and to utilize at the same time some of the set-theoretic concepts of the Schröder logic and of Principia mathematica which have become familiar to logicians. As will be seen, a considerable simplification results from this arrangement.The theory is not set up as a pure formalism, but rather in the usual manner of elementary axiom theory, where we have to deal with propositions which are understood to have a meaning, and where the reference to the domain of facts to be axiomatized is suggested by the names for the kinds of individuals and for the fundamental predicates.On the other hand, from the formulation of the axioms and the methods used in making inferences from them, it will be obvious that the theory can be formalized by means of the logical calculus of first order (“Prädikatenkalkul” or “engere Funktionenkalkül”) with the addition of the formalism of equality and the ι-symbol for “descriptions” (in the sense of Whitehead and Russell). (shrink)

The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κth level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms heavily depend on the context in (...) which they are embedded. The context here will be the theory CZF− of constructive Zermelo–Fraenkel set theory but without -Induction . Let INAC be the statement that for every set there is an inaccessible set containing it. CZF−+INAC is a mathematically rich theory in which one can easily formalize Bishop style constructive mathematics and a great deal of category theory. CZF−+INAC also has a realizability interpretation in type theory which gives its theorems a direct computational meaning. The main result presented here is that the proof theoretic ordinal of CZF−+INAC is a small ordinal known as the Feferman–Schütte ordinal Γ0. (shrink)

Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by introducing plumpness, which strengthens transitivity. This clarifies the traditional development of successors and unions, making it intuitionistic; even the (classical) proof of trichotomy is made simpler. The definition is, however, recursive, and, as their name suggests, the plump ordinals (...) grow very rapidly. Directedness must be defined hereditarily. It is orthogonal to the other four conditions, and the lower powerdomain construction is shown to be the universal way of imposing it. We treat ordinals as order-types, and develop a corresponding set theory similar to Osius' transitive set objects. This presents Mostowski's theorem as a reflection of categories, and set-theoretic union is a corollary of the adjoint functor theorem. Mostowski's theorem and the rank for some of the notions of ordinal are formulated and proved without the axiom of replacement, but this seems to be unavoidable for the plump rank. The comparison between sets and toposes is developed as far as the identification of replacement with completeness, and there are some suggestions for further work in this area. Each notion of set or ordinal defines a free algebra for one of the theories discussed by Joyal and Moerdijk, namely joins of a family of arities together with an operation s satisfying conditions such as x ≤ sx, monotonicity or s(x ∨ y) ≤ sx ∨ sy. Finally we discuss the fixed point theorem for a monotone endofunction s of a poset with least element and directed joins. This may be proved under each of a variety of additional hypotheses. We explain why it is unlikely that any notion of ordinal obeying the induction scheme for arbitrary predicates will prove the pure result. (shrink)

We explain and explore class-theoretic potentialism—the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning the relevant potentialist systems (in particular exhibiting failures of the $\mathsf {.2}$ and $\mathsf {.3}$ axioms). We then discuss the significance of these results for the different kinds of class-theoretic potentialists.

This paper establishes model-theoretic properties of \, a variation of monadic first-order logic that features the generalised quantifier \. We will also prove analogous versions of these results in the simpler setting of monadic first-order logic with and without equality and \, respectively). For each logic \ we will show the following. We provide syntactically defined fragments of \ characterising four different semantic properties of \-sentences: being monotone and continuous in a given set of monadic predicates; having truth (...) preserved under taking submodels or being truth invariant under taking quotients. In each case, we produce an effectively defined map that translates an arbitrary sentence \ to a sentence \ belonging to the corresponding syntactic fragment, with the property that \ is equivalent to \ precisely when it has the associated semantic property. As a corollary of our developments, we obtain that the four semantic properties above are decidable for \-sentences. (shrink)

This paper is concerned with the way different axiom systems for set theory can be justified by appeal to such intuitions as limitation of size, predicativity, stratification, etc. While none of the different conceptions historically resulting from the impetus to provide a solution to the paradoxes turns out to rest on an intuition providing an unshakeable foundation,'each supplies a picture of the set-theoretic universe that is both useful and internally well motivated. The same is true of more recently proposed (...) axiom systems for non-well-founded universes, and an attempt is made to motivate such axiom systems on the basis of an old and respected ‘algebraic’ intuition. (shrink)

We prove that for a finitely generated infinite nilpotent group $G$ with structure $(G,\cdot,\dots)$, the connected component ${G^*}^0$ of a sufficiently saturated extension $G^*$ of $G$ exists and equals \[ \bigcap_{n\in\N} \{g^n\colon g\in G^*\}. \] We construct an expansion of ${\mathbb Z}$ by a predicate $({\mathbb Z},+,P)$ such that the type-connected component ${{\mathbb Z}^*}^{00}_{\emptyset}$ is strictly smaller than ${{\mathbb Z}^*}^0$. We generalize this to finitely generated virtually solvable groups. As a corollary of our construction we obtain an optimality result for (...) the van der Waerden theorem for finite partitions of groups. (shrink)

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos due to Shulman, we show that WISC is independent of the rest of the axioms of the set theory given by a well-pointed topos. This also gives an example of a topos that is not a predicative (...) topos as defined by van den Berg. (shrink)

The state of affairs of some things falling under a predicate is supposedly a single entity that collects these things as its constituents. But whether we think of a state of affairs as a fact, a proposition or a possibility, problems will arise if we adopt a plural logic. For plural logic says that any plurality include themselves, so whenever there are some things, the state of affairs of their plural self-inclusion should be a single thing that collects them all. (...) This leads to paradoxes analogous to those that afflict naïve set theory. Here I suggest that they are the very same paradoxes, because sets can be reduced to states of affairs. However, to obtain a consistent theoretical reduction we must restrict the usual axiom scheme of Comprehension for plural logic to ‘stratified’ formulas, to avoid viciously circular definitions. I prove that with this modification to the background plural logic, the theory of states of affairs is consistent; moreover, it yields the axioms of the familiar set theory NFU. (shrink)

ABSTRACT Theories of sets such as Zermelo Fraenkel set theory are usually presented as the combination of two distinct kinds of principles: logical and set-theoretic principles. The set-theoretic principles are imposed ‘on top’ of first-order logic. This is in agreement with a traditional view of logic as universally applicable and topic neutral. Such a view of logic has been rejected by the intuitionists, on the ground that quantification over infinite domains requires the use of intuitionistic rather than classical (...) logic. In the following, I consider constructive set theories, which use intuitionistic rather than classical logic, and argue that they manifest a distinctive interdependence or an entanglement between sets and logic. In fact, Martin-Löf type theory identifies fundamental logical and set-theoretic notions. Remarkably, one of the motivations for this identification is the thought that classical quantification over infinite domains is problematic, while intuitionistic quantification is not. The approach to quantification adopted in Martin-Löf’s type theory is subtly interconnected with its predicativity. I conclude by recalling key aspects of an approach to predicativity inspired by Poincaré, which focuses on the issue of correct quantification over infinite domains and relate it back to Martin-Löf type theory. (shrink)

We introduce a notion of syntactical truth predicate (s.t.p.) for the second order arithmetic PA 2 . An s.t.p. is a set T of closed formulas such that: (i) T(t = u) if and only if the closed first order terms t and u are convertible, i.e., have the same value in the standard interpretation (ii) T(A → B) if and only if (T(A) $\Longrightarrow$ T(B)) (iii) T(∀ x A) if and only if (T(A[x ← t]) for any closed first (...) order term t) (iv) T(∀ X A) if and only if (T(A[X ←▵]) for any closed set definition $\triangle = \{x \mid D(x)\}$ ). S.t.p.'s can be seen as a counterpart to Tarski's notion of (model-theoretical) validity and have main model properties. In particular, their existence is equivalent to the existence of an ω-model of PA 2 , this fact being provable in PA 2 with arithmetical comprehension only. (shrink)

In this paper we discuss two approaches to the axiomatization of scientific theories in the context of the so called semantic approach, according to which (roughly) a theory can be seen as a class of models. The two approaches are associated respectively to Suppes’ and to da Costa and Chuaqui’s works. We argue that theories can be developed both in a way more akin to the usual mathematical practice (Suppes), in an informal set theoretical environment, writing the set theoretical predicate (...) in the language of set theory itself or, more rigorously (da Costa and Chuaqui), by employing formal languages that help us in writing the postulates to define a class of structures. Both approaches are called internal , for we work within a mathematical framework, here taken to be first-order ZFC. We contrast these approaches with an external one, here discussed briefly. We argue that each one has its strong and weak points, whose discussion is relevant for the philosophical foundations of science. (shrink)

We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced by Takeuti and Titani to formulate an intuitionistic set theory and an intuitionistic fuzzy set theory together with their metatheories. Here we define analytic Gentzen style calculi for GI and GIF. Among other things, these calculi allows one to prove Herbrand’s theorem for suitable fragments of GI and GIF.

This thesis presents a proof theoretical investigation of some constructive set theories with restricted set induction. The set theories considered are various systems of Constructive Zermelo Fraenkel set theory, CZF ([1]), in which the schema of $\in$ - Induction is either removed or weakened. We shall examine the theories $CZF^\Sigma_\omega$ and $CZF_\omega$, in which the $\in$ - Induction scheme is replaced by a scheme of induction on the natural numbers (only for  formulas in the case of the first theory, (...) for arbitrary formulas in the second theory). Of particular interest is the system CZF− + INAC, which is obtained by removing $\in$ - Induction and by adding an axiom, INAC, for inaccessible sets. The main outcome is that CZF− + INAC is a predicative set theory with inaccessible sets, its proof theoretic ordinal being $\Gamma_0$. The proof theoretic strength of these theories, has been determined by means of proof theoretical reductions. The upper bounds have been obtained by interpreting the set theories in classical theories of (iterated) inductive definitions with ordinals. A significant feature of these interpretations is that they are realizability interpretations, which make an indirect use of Aczel’s interpretation of CZF in Martin Löf type theory, and, in the case of CZF− + INAC, also employ a maximum bisimulation relation to represent equality between sets. The lower bounds are obtained by interpreting appropriate subsystems of intuitionistic second order arithmetic in the set theories. At the conclusion of the thesis we present work unrelated to the previous chapters. It is a preliminary study of the constructible hierarchy in CZF. We begin by formalizing the notion of definability in constructive set theory and then introduce Gödel’s L in CZF. We prove that intuitionistic L is a model of a subsystem of CZF strong enough to include intuitionistic Kripke-Platek set theory, and also that L is a model of the axiom of constructibility, provably in CZF. (shrink)

We recently showed that it is possible to deal withcollections of indistinguishable elementary particles (in thecontext of quantum mechanics) in a set-theoretical framework, byusing hidden variables. We propose in the presentpaper another axiomatics for collections of indiscernibleswithout hidden variables, where hidden predicates are implicitlyassumed. We also discuss the possibility of a quasi-settheoretical picture for quantum theory. Quasi-set theory, basedon Zermelo-Fraenkel set theory, was developed for dealing withcollections of indistinguishable, but, not identical objects.

We recently showed that it is possible to deal withcollections of indistinguishable elementary particles (in thecontext of quantum mechanics) in a set-theoretical framework, byusing hidden variables. We propose in the presentpaper another axiomatics for collections of indiscernibleswithout hidden variables, where hidden predicates are implicitlyassumed. We also discuss the possibility of a quasi-settheoretical picture for quantum theory. Quasi-set theory, basedon Zermelo-Fraenkel set theory, was developed for dealing withcollections of indistinguishable, but, not identical objects.

In this thesis I focus on F. H. Bradley's theory of judgment and his doctrine of predication. My goal is to present an account of Bradley's views which pays special attention to his belief that all logical predication must necessarily fail to accomplish what it sets out to do. All assertion , we are told, attempts to state truth, whole and complete; but, in the end, it must fall short. All judgment, Bradley claims, must contain an element of untruth or (...) falsity. And the outcome of this theory of predication is a doctrine of "degrees of truth". No truth is understood as entirely true or entirely false; rather, each has a position in a hierarchy of truths with some being truer than others when measured against the theoretical criterion of absolute knowledge. ;But, this is not to be understood as a sceptical doctrine. I argue that Bradley's doctrine of predicative failure should be seen as the only means by which radical scepticism in the theory of knowledge can be avoided. If we were capable of possessing truths which are whole and complete unto themselves then there would exist no legitimate basis upon which the inferential development of thought could expand beyond a self-enclosed circle. ;In this essay I also examine a persisting historical problem. It is my claim that Bradley's theory should be understood as a continuation of and development within the British neo-Kantian tradition. Bradley's association with this tradition has sometimes been questioned based on scattered statements found in the 1883 edition of the Principles of Logic. Collectively these statements have been referred to as the doctrine of "floating ideas". However, I maintain that the doctrine of floating ideas must be distinguished from the theory of predicative failure . I argue that the two theories should in no way be identified and that certain misinterpretations of Bradley's position have resulted from confusing these two incompatible views. (shrink)

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta_1$ . We show that $I\Delta_1$ is independent from the set of all true arithmetical $\Pi_2-sentences$ . Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta_1-induction$ . An open problem formulated by (...) J. Paris is whether $I\Delta_1$ proves the corresponding least element principle for decidable predicates, $L\Delta_1$ (or, equivalently. the $\Sigma_1-collection$ principle $B\Sigma_1$ ). We reduce this question to a purely computation-theoretic one. (shrink)

In his recent article, ``Self-Consciousness'’, George Bealer has set outa novel and interesting argument against functionalism in the philosophyof mind. I shall attempt to show, however, that Bealer's argument cannotbe sustained.In arguing for this conclusion, I shall be defending three main theses.The first is connected with the problem of defining theoreticalpredicates that occur in theories where the following two features arepresent: first, the theoretical predicate in question occurswithin both extensional and non-extensional contexts; secondly, thetheory in question asserts that the relevant (...) theoretical states enterinto causal relations. What I shall argue is that a Ramsey-styleapproach to the definition of such theoretical terms requires twodistinct quantifiers: one which ranges over concepts, and theother which ranges over properties in the world.My second thesis is a corollary: since the theories on whichBealer is focusing have both of the features just mentioned, and sincethe method that he employs to define theoretical terms in his argumentagainst functionalism does not involve both quantifiers that range overproperties and quantifiers that range over concepts, that method isunsound.My final thesis is that when a sound method is used, Bealer's argumentagainst functionalism no longer goes through.The structure of my discussion is as follows. I begin by setting out twoarguments – the one, a condensed version of Bealer's argument, andthe other, an argument that parallels Bealer's argument very closely.The parallel argument leads to a conclusion, however, that, rather thanbeing merely somewhat surprising, seems very implausible indeed. Forwhat the second argument establishes, if sound, is that there can betheoretical terms that apply to objects by virtue of their first-orderphysical properties, but whose meaning cannot be defined via aRamsey-style approach.Having set out the two parallel arguments, I then go on to focus uponthe second, to determine what is wrong with it. My diagnosis will bethat the problem with the argument arises from the fact that it involvesdefining a theoretical term that occurs both inside and outside ofopaque contexts, for the method employed fails to take into account thefact that the types of entities that are involved in the relevanttruthmakers are different when a sentence occurs within an extensionalcontext from those involved when a sentence occurs within anon-extensional context.I then go on to discuss how one should define a theoretical term thatoccurs within such theories, and I argue that in such a case one needstwo quantifiers, ranging over different types of entities – on theone hand, over properties and relations, and the other, over concepts. Ithen show that, when such an approach is followed, the argument inquestion collapses.I then turn to Bealer's argument against functionalism, and I show,first, that precisely the same method of defining theoretical terms canbe applied there, and, secondly, that, when this is done, it turns outthat that argument is also unsound.Next, I consider two responses that Bealer might make to my argument,and I argue that those responses would not succeed.Finally, I conclude by asking exactly where the problem lies in the caseof Bealer's argument. My answer will be that it is not simply the factthat one is dealing with a theoretical term that occurs in bothextensional and non-extensional contexts. It is rather the combinationof that feature together with the fact that the theory in questionasserts that the relevant type of theoretical state enters into causalrelations. For the first of these features means that the Ramseysentence for the theory must involve quantification over concepts, whilethe presence of the second feature means that the Ramsey sentence mustinvolve quantification over properties in the world, and so no attemptto offer a Ramsey-style account of the meaning of the relevanttheoretical term can succeed unless one employs both quantification overconcepts and quantification over properties. Bealer, however, in hisargument against functionalism, uses a method of defining theoreticalterms that does not involve both types of quantification, and it isprecisely because of this that his argument does not in the end succeed. (shrink)

Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy lies in the details of setting up and checking the properties of a coding system representing the syntax of an object language within that same language. These details are seldom illuminating and tend to obscure the core of the argument. For this reason a number of efforts have been made to present the essentials of the proofs of Gödel's theorems without getting mired in syntactic or (...) computational details. One of the most important of these efforts was made by Löb [8] in connection with his analysis of sentences asserting their own provability. Löb formulated three conditions, on the provability predicate in a formal system which are jointly sufficient to yield the Gödel's second incompleteness theorem for it. A key role in Löb's analysis is played by what later became known as the diagonalization or fixed point property of formal systems, a property which had already, in essence, been exploited by Gödel in his original proofs of the incompleteness theorems. The fixed point property plays a central role in Lawvere's [7] category-theoretic account of incompleteness phenomena. (shrink)

The main aim of this work is to evaluate whether Boolos’ semantics for second-order languages is model-theoretically equivalent to standard model-theoretic semantics. Such an equivalence result is, actually, directly proved in the “Appendix”. I argue that Boolos’ intent in developing such a semantics is not to avoid set-theoretic notions in favor of pluralities. It is, rather, to prevent that predicates, in the sense of functions, refer to classes of classes. Boolos’ formal semantics differs from a semantics of (...) pluralities for Boolos’ plural reading of second-order quantifiers, for the notion of plurality is much more general, not only of that set, but also of class. In fact, by showing that a plurality is equivalent to sub-sets of a power set, the notion of plurality comes to suffer a loss of generality. Despite of this equivalence result, I maintain that Boolos’ formal semantics does not committ second-order languages to second-order entities, contrary to standard semantics. Further, such an equivalence result provides a rationale for many criticisms to Boolos’ formal semantics, in particular those by Resnik and Parsons against its alleged ontological innocence and on its Platonistic presupposition. The key set-theoretic notion involved in the equivalence proof is that of many-valued function. But, first, I will provide a clarification of the philosophical context and theoretical grounds of the genesis of Boolos’ formal semantics. (shrink)

Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy lies in the details of setting up and checking the properties of a coding system representing the syntax of an object language (typically, that of arithmetic) within that same language. These details are seldom illuminating and tend to obscure the core of the argument. For this reason a number of efforts have been made to present the essentials of the proofs of Gödel’s theorems without getting (...) mired in syntactic or computational details. One of the most important of these efforts was made by Löb [8] in connection with his analysis of sentences asserting their own provability. Löb formulated three conditions (now known as the Hilbert-Bernays-Löb derivability conditions), on the provability predicate in a formal system which are jointly sufficient to yield the Gödel’s second incompleteness theorem for it. A key role in Löb’s analysis is played by (a special case of) what later became known as the diagonalization or fixed point property of formal systems, a property which had already, in essence, been exploited by Gödel in his original proofs of the incompleteness theorems. The fixed point property plays a central role in Lawvere’s [7] category-theoretic account of incompleteness phenomena (see also [10]). Incompleteness theorems have also been subjected to intensive investigation within the framework of modal logic (see, e.g.[4], [5]). In this formulation the modal operator takes up the role previously played by the provability predicate, and the derivability conditions on the latter are translated into algebraic conditions (the so-called GL, i.e., Gödel–Löb, conditions) on the former. My purpose here is to present a framework for incompleteness phenomena, fully compatible with intuitionistic or constructive principles, in which the idea of a coding system is retained, only in a 2 simple, but very general form, a form wholly free of syntactical notions. As codes we shall take the elements of an arbitrary given nonempty set, possibly, but not necessarily, the set of natural numbers.. (shrink)

Husserlian Essentialism is the view, maintained byEdmundHusserl throughout his career, that necessary truths obtain because essentialist truths obtain. In this thesis I have two goals. First, to reconstruct and flesh out Husserlian Essentialism and its connections with surrounding areas of Husserl's philosophy in full detail – something which has not been done yet. Second, to assess the theoretical solidity of the view. As regards the second point, after having presented Husserlian Essentialism in the first two chapters, I raise a serious (...) problem for it in Chapter 3. In the remainder of the thesis I endeavour to solve the problem. In order to do so, I propose to amend both Husserl's theory of essence and his theory of predication. The bulk of the emendation consists in working out an account of essence and an account of predication that do not presuppose, or in any way imply, the claims that: 1) for a universal to be in the essence of an object, either the object or one of its parts must instantiate the universal; 2) for a universal to be truly predicated of an object, either the object or one of its parts must instantiate the universal. These claims, notice, apart from being what gets Husserl in trouble, are well entrenched not only in Husserl's, but in most theories of essence and predication. It is thus interesting to see what an alternative option may be – even regardless of the Husserlian setting in which I work it out. (shrink)

In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A ≤T 0' is nonlow₂ if and only if A is prime bounding, i.e., for every complete atomic decidable theory T, there is a prime model M computable in A. The authors presented nine seemingly unrelated predicates of a set A, and showed that they are equivalent $\Delta _{2}^{0}$ sets. Some of these predicates, such as prime bounding, and others involving equivalence structures and abelian p-groups come (...) from model theory, while others involving meeting dense sets in trees and escaping a given function come from pure computability theory. As predicates of A, the original nine properties are equivalent for $\Delta _{2}^{0}$ sets; however, they are not equivalent in general. This articale examines the (degree-theoretic) relationship between the nine properties. We show that the nine properties fall into three classes, each of which consists of several equivalent properties. We also investigate the relationship between the three classes, by determining whether or not any of the predicates in one class implies a predicate in another class. (shrink)

A new foundation for constructive nonstandard analysis is presented. It is based on an extension of a sheaf-theoretic model of nonstandard arithmetic due to I. Moerdijk. The model consists of representable sheaves over a site of filter bases. Nonstandard characterisations of various notions from analysis are obtained: modes of convergence, uniform continuity and differentiability, and some topological notions. We also obtain some additional results about the model. As in the classical case, the order type of the nonstandard natural numbers (...) is a dense set of copies of the integers. Every standard set has a hyperfinite enumeration of its standard elements in the model. All arguments are carried out within a constructive and predicative metatheory: Martin-Löf's type theory. (shrink)

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other (...) set-theoretic systems ZF, NBG, and NF. We discuss two methods of axiomatizing higher order quantification and abstraction, and then very briefly discuss the application of one of these methods to areas of mathematics outside of logic. (shrink)

Este texto introduz a tradução do discurso de intitulado "Sobre os números transfinitos" ("Über transfinite Zahlen"), proferido por Henri Poincaré em 27 de abril de 1909, na Universidade de Göttingen. Após uma breve apresentação do pensamento do autor acerca dos fundamentos da aritmética, procura-se citar os aspectos mais relevantes da chamada crise dos fundamentos da matemática, para então introduzir a reformulação do conceito de predicatividade aventada no referido discurso sobre números transfinitos, contribuição compreendida como um recurso teórico necessário para a (...) superação dos paradoxos relativos à teoria dos conjuntos. Com isso, pretende-se evidenciar o papel central do texto publicado nesta edição para o desenvolvimento da concepção matemática de Henri Poincaré. This article provides an introduction to the translation of the lecture entitled "On transfinite numbers" ("Über transfinite Zahlen"), given by Henri Poincaré at the University of Göttingen on April 27, 1909. Following a short presentation of Poincaré's views on the foundations of arithmetic, it identifies the aspects of the so-called crisis of the foundations of mathematics that are most relevant for understanding his reconstruction of the concept of predicativity, which is intended to be a theoretical resource that may overcome the paradoxes of set theory. In doing so, the article highlights the central role of this text in the process of maturation of Poincaré's views on the foundations of mathematics. (shrink)

Set-theoretic pluralism is an increasingly influential position in the philosophy of set theory (Balaguer [1998], Linksy and Zalta [1995], Hamkins [2012]). There is considerable room for debate about how best to formulate set-theoretic pluralism, and even about whether the view is coherent. But there is widespread agreement as to what there is to recommend the view (given that it can be formulated coherently). Unlike set-theoretic universalism, set-theoretic pluralism affords an answer to Benacerraf’s epistemological challenge. The purpose (...) of this paper is to determine what Benacerraf’s challenge could be such that this view is warranted. I argue that it could not be any of the challenges with which it has been traditionally identified by its advocates, like of Benacerraf and Field. Not only are none of the challenges easier for the pluralist to meet. None satisfies a key constraint that has been placed on Benacerraf’s challenge. However, I argue that Benacerraf’s challenge could be the challenge to show that our set-theoretic beliefs are safe – i.e., to show that we could not have easily had false ones. Whether the pluralist is, in fact, better positioned to show that our set-theoretic beliefs are safe turns on a broadly empirical conjecture which is outstanding. If this conjecture proves to be false, then it is unclear what the epistemological argument for set-theoretic pluralism is supposed to be. (shrink)

We consider the structures $$, $$, $$, and $$ where $\mathbb {Z}$ is the additive group of integers, $\mathrm {SF}^{\mathbb {Z}}$ is the set of $a \in \mathbb {Z}$ such that $v_{p} < 2$ for every prime p and corresponding p-adic valuation $v_{p}$, $\mathbb {Q}$ and $\mathrm {SF}^{\mathbb {Q}}$ are defined likewise for rational numbers, and $<$ denotes the natural ordering on each of these domains. We prove that the second structure is model-theoretically wild while the other three structures are (...) model-theoretically tame. Moreover, all these results can be seen as examples where number-theoretic randomness yields model-theoretic consequences. (shrink)

This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory. In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Ketonen and Solovay. This provides a background for an analysis of subsystems of Peano Arithmetic as well as for (...) combinatorial independence results. Next, the volume examines a variety of proofs of Gödel's incompleteness theorems. The presented proofs differ strongly in nature. They show various aspects of incompleteness phenomena. In additon, coverage introduces some classical methods like the arithmetized completeness theorem, satisfaction predicates or partial satisfaction classes. It also applies them in many contexts. The fourth chapter defines the method of indicators for obtaining independence results. It shows what amount of transfinite induction we have in fragments of Peano arithmetic. Then, it uses combinatorics of large sets of the first chapter to show independence results. The last chapter considers nonstandard satisfaction classes. It presents some of the classical theorems related to them. In particular, it covers the results by S. Smith on definability in the language with a satisfaction class and on models without a satisfaction class. Overall, the book's content lies on the border between combinatorics, proof theory, and model theory of arithmetic. It offers readers a distinctive approach towards independence results by model-theoretic methods. (shrink)

This book attempts to marry truth-conditional semantics with cognitive linguistics in the church of computational neuroscience. To this end, it examines the truth-conditional meanings of coordinators, quantifiers, and collective predicates as neurophysiological phenomena that are amenable to a neurocomputational analysis. Drawing inspiration from work on visual processing, and especially the simple/complex cell distinction in early vision (V1), we claim that a similar two-layer architecture is sufficient to learn the truth-conditional meanings of the logical coordinators and logical quantifiers. As a (...) prerequisite, much discussion is given over to what a neurologically plausible representation of the meanings of these items would look like. We eventually settle on a representation in terms of correlation, so that, for instance, the semantic input to the universal operators (e.g. and, all)is represented as maximally correlated, while the semantic input to the universal negative operators (e.g. nor, no)is represented as maximally anticorrelated. On the basis this representation, the hypothesis can be offered that the function of the logical operators is to extract an invariant feature from natural situations, that of degree of correlation between parts of the situation. This result sets up an elegant formal analogy to recent models of visual processing, which argue that the function of early vision is to reduce the redundancy inherent in natural images. Computational simulations are designed in which the logical operators are learned by associating their phonological form with some degree of correlation in the inputs, so that the overall function of the system is as a simple kind of pattern recognition. Several learning rules are assayed, especially those of the Hebbian sort, which are the ones with the most neurological support. Learning vector quantization (LVQ) is shown to be a perspicuous and efficient means of learning the patterns that are of interest. We draw a formal parallelism between the initial, competitive layer of LVQ and the simple cell layer in V1, and between the final, linear layer of LVQ and the complex cell layer in V1, in that the initial layers are both selective, while the final layers both generalize. It is also shown how the representations argued for can be used to draw the traditionally-recognized inferences arising from coordination and quantification, and why the inference of subalternacy breaks down for collective predicates. Finally, the analogies between early vision and the logical operators allow us to advance the claim of cognitive linguistics that language is not processed by proprietary algorithms, but rather by algorithms that are general to the entire brain. Thus in the debate between objectivist and experiential metaphysics, this book falls squarely into the camp of the latter. Yet it does so by means of a rigorous formal, mathematical, and neurological exposition – in contradiction of the experiential claim that formal analysis has no place in the understanding of cognition. To make our own counter-claim as explicit as possible, we present a sketch of the LVQ structure in terms of mereotopology, in which the initial layer of the network performs topological operations, while the final layer performs mereological operations. The book is meant to be self-contained, in the sense that it does not assume any prior knowledge of any of the many areas that are touched upon. It therefore contains mini-summaries of biological visual processing, especially the retinocortical and ventral /what?/ parvocellular pathways computational models of neural signaling, and in particular the reduction of the Hodgkin-Huxley equations to the connectionist and integrate-and-fire neurons Hebbian learning rules and the elaboration of learning vector quantization the linguistic pathway in the left hemisphere memory and the hippocampus truth-conditional vs. image-schematic semantics objectivist vs. experiential metaphysics and mereotopology. All of the simulations are implemented in MATLAB, and the code is available from the book’s website. • The discovery of several algorithmic similarities between visison and semantics. • The support of all of this by means of simulations, and the packaging of all of this in a coherent theoretical framework. (shrink)

In this article we study several reduction principles in the context of Simpson’s set theory ATR0S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ATR_{0}^{S}$$\end{document} and Kripke-Platek set theory KP (with infinity). Since ATR0S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ATR_{0}^{S}$$\end{document} is the set-theoretic version of ATR0 there is a direct link to second order arithmetic and the results for reductions over ATR0S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ATR_{0}^{S}$$\end{document} are as expected and more or (...) less straightforward. However, over KP we obtain several interesting new results and are lead to some open questions. (shrink)

The multiverse view in set theory, introduced and argued for in this article, is the view that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe. The universe view, in contrast, asserts that there is an absolute background set concept, with a corresponding absolute set-theoretic universe in which every set-theoretic question has a definite answer. The multiverse position, I argue, explains our experience with the enormous range of set-theoretic possibilities, a phenomenon (...) that challenges the universe view. In particular, I argue that the continuum hypothesis is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for. (shrink)

On some views, we can be sure that parties to a dispute over the logic of ‘exists’ are not talking past each other if they can characterise ‘exists’ as the only monadic predicate up to logical equivalence obeying a certain set of rules of inference. Otherwise, we ought to be suspicious about the reality of their disagreement. This is what we call a proof- theoretic argument. Pace some critics, who have tried to use proof-theoretic arguments to cast doubts (...) about the reality of disagreements about the logic of ‘exists’, we argue that proof-theoretic arguments can be deployed to establish the reality of several such disagreements. Along the way, we will also utilise this technique to establish similar results about some disagreements over the logic of identity. (shrink)