Unrestricted use of the axiom schema of comprehension, ?to every mathematically (or set-theoretically) describable property there corresponds the set of all mathematical (or set-theoretical) objects having that property?, leads to contradiction. In set theories of the Zermelo?Fraenkel?Skolem (ZFS) style suitable instances of the comprehension schema are chosen ad hoc as axioms, e.g.axioms which guarantee the existence of unions, intersections, pairs, subsets, empty set, power sets and replacement sets. It is demonstrated that a uniform syntactic description may be (...) given of acceptable instances of the comprehension schema, which include all of the axioms mentioned, and which in their turn are theorems of the usual versions of ZFS set theory. Well then, shall we proceed as usual and begin by assuming the existence of a single essential nature or Form for every set of things which we call by the same name? Do you understand? (Plato, Republic X.596a6; cf. Cornford 1966, 317). (shrink)

There seems to be a view that intuitionists not only take the Axiom of Choice (AC) to be true, but also believe it a consequence of their fundamental posits. Widespread or not, this view is largely mistaken. This article offers a brief, yet comprehensive, overview of the status of AC in various intuitionistic and constructivist systems. The survey makes it clear that the Axiom of Choice fails to be a theorem in most contexts and is even outright false (...) in some important contexts. Of the systems surveyed, only intensional type theory renders AC a theorem, but the extent of AC in that theory does not include, for instance, real analysis. Only a small amount of extensionality is required in order for the obvious proof an intuitionist might offer for AC to break down. (shrink)

In this paper, we present set theories based upon the paraconsistent logic Pac. We describe two different techniques to construct models of such set theories. The first of these is an adaptation of one used to construct classical models of positive comprehension. The properties of the models obtained in that way give rise to a natural paraconsistent set theory which is presented here. The status of the axiom of choice in that theory is also discussed. The second leads (...) to show that any classical universe of set theory (e.g. a model of ZF) can be extended to a paraconsistent one, via a term model construction using an adapted bisimulation technique. (shrink)

When constrained by limited resources, how do we choose axioms of rationality? The target article relies on Bayesian reasoning that encounter serioustractabilityproblems. We propose another axiomatic foundation: quantum probability theory, which provides for less complex and more comprehensive descriptions. More generally, defining rationality in terms of axiomatic systems misses a key issue: rationality must be defined by humans facing vague information.

In their logical analysis of theorems about disjoint rays in graphs, Barnes, Shore, and the author (hereafter BGS) introduced a weak choice scheme in second-order arithmetic, called the $\Sigma ^1_1$ axiom of finite choice (hereafter finite choice). This is a special case of the $\Sigma ^1_1$ axiom of choice ( $\Sigma ^1_1\text {-}\mathsf {AC}_0$ ) introduced by Kreisel. BGS showed that $\Sigma ^1_1\text {-}\mathsf {AC}_0$ suffices for proving many of the aforementioned theorems in graph theory. While it is (...) not known if these implications reverse, BGS also showed that those theorems imply finite choice (in some cases, with additional induction assumptions). This motivated us to study the proof-theoretic strength of finite choice. Using a variant of Steel forcing with tagged trees, we show that finite choice is not provable from the $\Delta ^1_1$ -comprehension scheme (even over $\omega $ -models). We also show that finite choice is a consequence of the arithmetic Bolzano–Weierstrass theorem (introduced by Friedman and studied by Conidis), assuming $\Sigma ^1_1$ -induction. Our results were used by BGS to show that several theorems in graph theory cannot be proved using $\Delta ^1_1$ -comprehension. Our results also strengthen results of Conidis. (shrink)

The paper argues that the liar paradox teaches us these lessons about English. First, the paradox-yielding sentence is a sentence of English that is neither true nor false in English. Second, there is no English name for any such thing as a set of all and only true sentences of English. Third, ‘is true in English’ does not satisfy the axiom of comprehension.

The signature of the formal language of mereology contains only one binary predicate which stands for the relation “being a part of” and it has been strongly suggested that such a predicate must at least define a partial ordering. Mereological theories owe their origin to Leśniewski. However, some more recent authors, such as Simons as well as Casati and Varzi, have reformulated mereology in a way most logicians today are familiar with. It turns out that any theory which can be (...) formed by using the reformulated mereological axioms or axiom schemas is in a sense a subtheory of the elementary theory of Boolean algebras or of the theory of infinite atomic Boolean algebras. It is known that the theory of partial orderings is undecidable while the elementary theory of Boolean algebras and the theory of infinite atomic Boolean algebras are decidable. In this paper, I will look into the behaviors in terms of decidability of those mereological theories located in between. More precisely, I will give a comprehensive picture of the said issue by offering solutions to the open problems which I have raised in some of my papers published previously. (shrink)

We introduce a certain extension of -calculus, and show that it has the Church-Rosser property. The associated open-term extensional combinatory algebra is used as a basis to construct models for theories of Explict Mathematics (formulated in the language of "types and names") with positive stratified comprehension. In such models, types are interpreted as collections of solutions (of terms) w.r. to a set of numerals. Exploiting extensionality, we prove some consistency results for special ontological axioms which are refutable under elementary (...) comprehension. (shrink)

This article addresses the use of foreign law in constitutional adjudication. We draw on the ideas of wide reflective equilibrium and public reason in order to defend an engagement model of comparative adjudication. According to this model, the judicial use of foreign law is justified if it proceeds by testing and mutually adjusting the principles and rulings of our constitutional doctrines against reasonable alternatives, as represented by the principles and rulings of other reasonable doctrines. By this, a court points to (...) a wide reflective equilibrium, justifying its own interpretations with reasonable arguments, i.e. arguments that are acceptable from the perspectives defined by other constitutional doctrines, as endorsed by other courts. The point of a judicial engagement of this sort is to work out an overlap between different, reasonable, doctrines in the judicial forum, as part of a liberal forum of public reason. Here, the exercise of public reason filters out the premises of comprehensive doctrines so as to leave us in the region of an overlapping consensus: a region of mid-level principles that can be shared, notwithstanding the fact of legal pluralism. (shrink)

Foundations of Set Theory discusses the reconstruction undergone by set theory in the hands of Brouwer, Russell, and Zermelo. Only in the axiomatic foundations, however, have there been such extensive, almost revolutionary, developments. This book tries to avoid a detailed discussion of those topics which would have required heavy technical machinery, while describing the major results obtained in their treatment if these results could be stated in relatively non-technical terms. This book comprises five chapters and begins with a discussion of (...) the antinomies that led to the reconstruction of set theory as it was known before. It then moves to the axiomatic foundations of set theory, including a discussion of the basic notions of equality and extensionality and axioms of comprehension and infinity. The next chapters discuss type-theoretical approaches, including the ideal calculus, the theory of types, and Quine's mathematical logic and new foundations; intuitionistic conceptions of mathematics and its constructive character; and metamathematical and semantical approaches, such as the Hilbert program. This book will be of interest to mathematicians, logicians, and statisticians. (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.This paper is the second in a series of three culminating in an ordinal analysis of Π12-comprehension. Its objective is to present an ordinal analysis for the subsystem of second order arithmetic with Δ12-comprehension, bar induction and Π12-comprehension for formulae without set parameters. Couched in terms of Kripke-Platek set theory, KP, the latter system corresponds to KPi augmented by the assertion that there exists a stable ordinal, where KPi is KP with an additional axiom stating that (...) every set is contained in an admissible set. (shrink)

We show that a theory of autonomous iterated Ramseyness based on second order arithmetic (SOA) is proof-theoretically equivalent to ${\Pi^1_2}$ -comprehension. The property of Ramsey is defined as follows. Let X be a set of real numbers, i.e. a set of infinite sets of natural numbers. We call a set H of natural numbers homogeneous for X if either all infinite subsets of H are in X or all infinite subsets of H are not in X. X has the (...) property of Ramsey if there exists a set which is homogeneous for X. The property of Ramsey is considered in reverse mathematics to compare the strength of subsystems of SOA. To characterize the system of ${\Pi^1_2}$ -comprehension in terms of Ramseyness we introduce a system of autonomous iterated Ramseyness, called R-calculus. We augment the language of SOA with additional set terms (called R-terms) ${R\vec{x}X\phi(\vec{x},X)}$ for each first order formula ${\phi(\vec{x},X)}$ (where φ may contain further R-terms). The R-calculus is a system which comprises comprehension for all first order formulas (which may contain R-terms or other set parameters) and defining axioms for the R-terms which claim that for each ${\vec{x}}$ , we can remove finitely many elements from the set ${R\vec{x}X\phi(\vec{x},X)}$ such that the remaining set is homogeneous for ${\{{X}{\phi(\vec{x},X)\}}}$ . We show that the R-calculus proves the same ${\Pi^1_1}$ -sentences as the system of ${\Pi^1_2}$ -comprehension. (shrink)

Determinacy axioms state the existence of winning strategies for infinite games played by two players on natural numbers. We show that a base theory enriched by a certain scheme of determinacy axioms is proof-theoretically equivalent to -comprehension.

The link between the high-order metaphysics and abstractions, on the one hand, and choice in the foundation of set theory, on the other hand, can distinguish unambiguously the “good” principles of abstraction from the “bad” ones and thus resolve the “bad company problem” as to set theory. Thus it implies correspondingly a more precise definition of the relation between the axiom of choice and “all company” of axioms in set theory concerning directly or indirectly abstraction: the principle of abstraction, (...) axiom of comprehension, axiom scheme of specification, axiom scheme of separation, subset axiom scheme, axiom scheme of replacement, axiom of unrestricted comprehension, axiom of extensionality, etc. (shrink)

Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension schema are consistent. One aim of this paper is to ascertain how much set theory can be developed within these consistent fragments of the Grundgesetze, and our main theorem shows that there is a model of a fragment of the Grundgesetze which defines (...) a model of all the axioms of Zermelo-Fraenkel set theory with the exception of the power set axiom. The proof of this result appeals to G\"odel's constructible universe of sets, which G\"odel famously used to show the relative consistency of the continuum hypothesis. More specifically, our proofs appeal to Kripke and Platek's idea of the projectum within the constructible universe as well as to a weak version of uniformization (which does not involve knowledge of Jensen's fine structure theory). The axioms of the Grundgesetze are examples of abstraction principles, and the other primary aim of this paper is to articulate a sufficient condition for the consistency of abstraction principles with limited amounts of comprehension. As an application, we resolve an analogue of the joint consistency problem in the predicative setting. (shrink)

This note explores the common core of constructive, intuitionistic, recursive and classical analysis from an axiomatic standpoint. In addition to clarifying the relation between Kleene’s and Troelstra’s minimal formal theories of numbers and number-theoretic sequences, we propose some modified choice principles and other function existence axioms which may be of use in reverse constructive analysis. Specifically, we consider the function comprehension principles assumed by the two minimal theories EL and M, introduce an axiom schema CFd asserting that every (...) decidable property of numbers has a characteristic function, and use it to describe a precise relationship between the minimal theories. We show that the axiom schema AC00 of countable choice can be decomposed into a monotone choice schema AC00m (which guarantees that every Cauchy sequence has a modulus) and a bounded choice schema BC00. We relate various (classically correct) axiom schemas of continuous choice to versions of the bar and fan theorems, suggest a constructive choice schema AC1/2,0 (which incidentally guarantees that every continuous function has a modulus of continuity), and observe a constructive equivalence between restricted versions of the fan theorem and correspondingly restricted bounding axioms \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${AB_{1/2,0}^{2^{\mathbb{n}}}}$$\end{document}. We also introduce a version WKL!! of Weak König’s Lemma with uniqueness which is intermediate in strength between WKL and the decidable fan theorem FTd. (shrink)

An ontology's theory of ontic predication has implications for the concomitant predicate logic. Remarkable in its analytic power for both ontology and logic is the here developed Particularized Predicate Logic (PPL), the logic inherent in the realist version of the doctrine of unit or individuated predicates. PPL, as axiomatized and proven consistent below, is a three-sorted impredicative intensional logic with identity, having variables ranging over individuals x, intensions R, and instances of intensions $R_{i}$ . The power of PPL is illustrated (...) by its clarification of the self-referential nature of impredicative definitions and its distinguishing between legitimate and illegitimate forms. With a wellmotivated refinement on the axiom of comprehension, PPL is, in effect, a higher-order logic without a forced stratification of predicates into types or the use of other ad hoc restrictions. The Russell-Priest characterization of the classic self-referential paradoxes is used to show how PPL diagnosis and solves these antimonies. A direct application of PPL is made to Grelling's Paradox. Also shown is how PPL can distinguish between identity and indiscernibility. (shrink)

We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak subsystems of second order arithmetic. Specifically, we consider the Cauchy/Peano existence theorem for solutions of ordinary differential equations, in the context of the formal system RCA 0 whose principal axioms are ▵ 0 1 comprehension and Σ 0 1 induction. Our main result is that, over RCA 0 , the Cauchy/Peano Theorem is provably equivalent to weak Konig's lemma, i.e. the statement that every infinite {0, (...) 1}-tree has a path. We also show that, over RCA 0 , the Ascoli lemma is provably equivalent to arithmetical comprehension, as is Osgood's theorem on the existence of maximum solutions. At the end of the paper we digress to relate our results to degrees of unsolvability and to computable analysis. (shrink)

BACKGROUND -/- The need for detailed description and modeling of cells drives the continuous generation of large and diverse datasets. Unfortunately, there exists no systematic and comprehensive way to organize these datasets and their information. CELDA (Cell: Expression, Localization, Development, Anatomy) is a novel ontology for the association of primary experimental data and derived knowledge to various types of cells of organisms. -/- RESULTS -/- CELDA is a structure that can help to categorize cell types based on species, anatomical localization, (...) subcellular structures, developmental stages and origin. It targets cells in vitro as well as in vivo. Instead of developing a novel ontology from scratch, we carefully designed CELDA in such a way that existing ontologies were integrated as much as possible, and only minimal extensions were performed to cover those classes and areas not present in any existing model. Currently, ten existing ontologies and models are linked to CELDA through the top-level ontology BioTop. Together with 15.439 newly created classes, CELDA contains more than 196.000 classes and 233.670 relationship axioms. CELDA is primarily used as a representational framework for modeling, analyzing and comparing cells within and across species in CellFinder, a web based data repository on cells (http://cellfinder.org). -/- CONCLUSIONS -/- CELDA can semantically link diverse types of information about cell types. It has been integrated within the research platform CellFinder, where it exemplarily relates cell types from liver and kidney during development on the one hand and anatomical locations in humans on the other, integrating information on all spatial and temporal stages. CELDA is available from the CellFinder website: http://cellfinder.org/about/ontology. (shrink)

In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA0*, which consists of the axioms of discrete ordered semi‐rings with exponentiation, Δ10 comprehension and Π00 induction, and which is known as a weaker system than the popularbase theory RCA0: 1. Bisep(Δ10, Σ10)‐Det* ↔ WKL0, 2. Bisep(Δ10, Σ20)‐Det* (...) ↔ ATR0 + Σ11 induction, 3. Bisep(Σ10, Σ20)‐Det* ↔ Sep(Σ10, Σ20)‐Det* ↔ Π11‐CA0, 4. Bisep(Δ20, Σ20)‐Det* ↔ Π11‐TR0, where Det* stands for the determinacy of infinite games in the Cantor space (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

In the paper we survey the known connections between theories that extend a common base theory with typed truth axioms on the one hand and predicative set-existence assumptions on the other. How general can the mutual reductions between truth and comprehension be taken to be? In trying to address this question, we consider classical, positive truth and predicative comprehension as operations on theories.

What should be immediately apparent to any writer of realistic fiction is its unreal or synthetic nature. Regardless of how persuasive the forgery appears, it is still a forgery. The colors of the painting are not identical to those of the real world. The illusion of similarity is achieved by trickery. The houses of realistic novels are like those found on a stage set; they are there to lend reality and weight to what is important, which may be a conversation (...) between two realistically dressed people, walking in front of the novels' realistic buildings, conversing about something which would, in actuality, be impossible to talk about openly, something which would, ordinarily, seem impossible to take seriously as a motive for violent emotion which leads to violent action. No matter how expertly and exactly a novelist's world duplicates common reality, the duplication must be a means to an end. Duplication itself is not the novel's goal. If it were, the novelist would be properly defined as a camera which takes pictures with words or as a maker of verbal documentaries who strives to capture the passing scene. This is an axiom which must appear self-evident to both the writer and the audience. However, when I wrote Anya , I found that this self-evident truth provided random and unreliable light; if this truth had been a source of electricity, it would be safe to say that its failure to illuminate caused a blackout of comprehension for many critics and readers. Susan Fromberg Schaeffer, professor of English at Brooklyn College of the City University of New York, is the author of Falling, Anya, and Time in Its Flight, several collections of poetry, including Rhymes and Runes of the Toad and Alphabet for the Lost Years, and, most recently, The Queen of Egypt and Other Stories. (shrink)

Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, (...) the axiom of choice, Zorn’s lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process. (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.

In positive theories, we have an axiom scheme of comprehension for positive formulas. We study here the “generalized positive” theory GPK∞+. Natural models of this theory are hyperuniverses. The author has shown in [2] that GPK∞+ interprets the Kelley Morse class theory. Here we prove that GPK∞+ + ACWF and the Kelley-Morse class theory with the axiom of global choice and the axiom “On is ramifiable” are mutually interpretable. This shows that GPK∞+ + ACWF is a (...) “strong” theory since “On is ramifiable” implies the existence of a proper class of inaccessible cardinals. (shrink)

Let CKDT be the assertion that for every countably infinite bipartite graph G, there exist a vertex covering C of G and a matching M in G such that C consists of exactly one vertex from each edge in M. (This is a theorem of Podewski and Steffens [12].) Let ATR0 be the subsystem of second-order arithmetic with arithmetical transfinite recursion and restricted induction. Let RCA0 be the subsystem of second-order arithmetic with recursive comprehension and restricted induction. We show (...) that CKDT is provable in ART0. Combining this with a result of Aharoni, Magidor, and Shore [2], we see that CKDT is logically equivalent to the axioms of ATR0, the equivalence being provable in RCA0. (shrink)

The neo-logicist argues tliat standard mathematics can be derived by purely logical means from abstraction principles—such as Hume's Principle— which are held to lie 'epistcmically innocent'. We show that the second-order axiom of comprehension applied to non-instantiated properties and the standard first-order existential instantiation and universal elimination principles are essential for the derivation of key results, specifically a theorem of infinity, but have not been shown to be epistemically innocent. We conclude that the epistemic innocence of mathematics has (...) not been established by the neo-logicist. (shrink)

In Summa theologiae, Ia, 75.5, Aquinas writes, "It is evident that all that is received in anything is received in it according to the mode of the receiver." Aquinas employs this principle throughout his career and across the full range of philosophical topics. Beginning with Quaestianes de veritate 2.5, he employs a more universal formulation which he applies even to divine being: "All that is in anything is in it according to the mode of that in which it is." As (...) modus is the term common to the principle's two formulations, I call it the modus principle. ;The dissertation is a comprehensive study of Thomas's use of the principle, based on computer research done with the Index Thomisticus and the St. Thomas CD-ROM. The 200 texts located are considered according to applications in the order of knowing, the order of being, and the order of predicating. In brief, Aquinas employs the modus principle and the term modus to give account of the intelligible coenactment in knowledge of the knower and the known; to give account of the entitative contrariety evident among beings; and to frame an analogy of being based on a primacy of existence. The principal conclusions drawn from the textual survey are that the modus principle belongs among the most basic axioms of Thomas's metaphysics, that it pertains directly to the metaphysical ultimate of his thought, namely esse, and that at the heart of the principle is a concept central to his metaphysics, namely modes of existence. ;When Aquinas subordinates formal contrariety to an actuality more ultimate than form, namely existence, a new concept of existential distinction emerges. Modus is a term of entitative contrariety that becomes necessary when a real duality of essence and existence is seen as necessary to all finite being. As Thomas traces this entitative composition to a participation in ipsum esse commune, and ultimately to a participation in ipsum esse per se subsistens, the term modus and the modus principle are seen to be in the service of his creationist metaphysics. (shrink)

Reverse mathematics is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, that is, non-set-theoretic, mathematics. As suggested by the title, this paper deals with the study of the topological notions of dimension and paracompactness, inside Kohlenbach’s higher-order RM. As to splittings, there are some examples in RM of theorems A, B, C such that A (...) ↔, that is, A can be split into two independent parts B and C, and the aforementioned topological notions give rise to a number of splittings involving highly natural A, B, C. Nonetheless, the higher-order picture is markedly different from the second-one: in terms of comprehension axioms, the proof in higher-order RM of, for example, the paracompactness of the unit interval requires full second-order arithmetic, while the second-order/countable version of paracompactness of the unit interval is provable in the base theory RCA 0. We obtain similarly “exceptional” results for the Urysohn identity, the Lindelöf lemma, and partitions of unity. We show that our results exhibit a certain robustness, in that they do not depend on the exact definition of cover, even in the absence of the axiom of choice. (shrink)

Logical works of this period, beginning with Generales Inquisitiones and ending wi th the two dated pieces of 1 Aug. 1690 and 2 Aug. 1690 , are read as a sustained effort, finally successful, to develop a set of axioms and an appropriate schema for the expression of categorical propositions faithful to traditional syllogistic. This same set of axioms is shown to be comprehensive of the propositional calculus of Principia Mathematica, providing that ‘Some A is A’ is not a thesis (...) in an unrestricted sense. There is no indication in the works of this period that Leibniz understood just how significant is this logicalsystem he developed. But it is undeniable that he held tenaciously to this particular set of axioms throughout the period, a set of axioms of great power. (shrink)

In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF– i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm property for those formulas which contain only terms corresponding to sets in ZF–. This implies that (...) LZF is a conservative extension of ZF– and therefore the former is consistent relative to the latter. (shrink)

The following note has on purpose to introduce interested students to logicism. Our objective is not to show any new interpretation or thesis about logicism or its rebirth between the 60s and 80s of the last century. What we will do is systematically show the evolution of logicism from Frege to Russell-Whitehead, with greater emphasis on this latest development, and approach some problems that arise within that movement, for example: The logical paradoxes and the principle of intuitive comprehension, the (...) impredicative definitions and the semantic paradoxes, the Ramified Hierarchy and real numbers, the axiom of reducibility and the impossibility of reducing mathematics to logic, etc. (shrink)

This book offers a comprehensive overview of the structure, strategy and methods of assessment of orthodox theoretical economics. In Part I Professor Hausman explains how economists theorise, emphasising the essential underlying commitment of economists to a vision of economics as a separate science. In Part II he defends the view that the basic axioms of economics are 'inexact' since they deal only with the 'major' causes; unlike most writers on economic methodology, the author argues that it is the rules that (...) economists espouse rather than their practice that is at fault. Part III links the conception of economics as a separate science to the fact that economic theories offer reasons and justifications for human actions, not just their causes. With its lengthy appendix introducing relevant issues in philosophy of science, this book is a major addition to philosophy of economics and of social science. (shrink)

"Ontology and the Foundations of Mathematics" consists of three papers concerned with ontological issues in the foundations of mathematics. Chapter 1, "Numbers and Persons," confronts the problem of the inscrutability of numerical reference and argues that, even if inscrutable, the reference of the numerals, as we ordinarily use them, is determined much more precisely than up to isomorphism. We argue that the truth conditions of a variety of numerical modal and counterfactual sentences place serious constraints on the sorts of items (...) to which numerals, as we ordinarily use them, can be taken to refer: Numerals cannot be taken to refer to objects that exist contingently such as people, mountains, or rivers, but rather must be taken to refer to objects that exist necessarily such as abstracta. ;Chapter 2, "Modern Set Theory and Replacement," takes up a challenge to explain the reasons one should accept the axiom of replacement of Zermelo-Fraenkel set theory, when its applications within ordinary mathematics and the rest of science are often described as rare and recondite. We argue that this is not a question one should be interested in; replacement is required to ensure that the element-set relation is well-founded as well as to ensure that the cumulation of sets described by set theory reaches and proceeds beyond the level o of the cumulative hierarchy. A more interesting question is whether we should accept instances of replacement on uncountable sets, for these are indeed rarely used outside higher set theory. We argue that the best case for replacement comes not from direct, intuitive considerations, but from the role replacement plays in the formulation of transfinite recursion and the theory of ordinals, and from the fact that it permits us to express and assert the content of the modern cumulative view of the set-theoretic universe as arrayed in a cumulative hierarchy of levels. ;Chapter 3, "A No-Class Theory of Classes," makes use of the apparatus of plural quantification to construe talk of classes as plural talk about sets, and thus provide an interpretation of both one- and two-sorted versions of first-order Morse-Kelley set theory, an impredicative theory of classes. We argue that the plural interpretation of impredicative theories of classes has a number of advantages over more traditional interpretations of the language of classes as involving singular reference to gigantic set-like entities, only too encompassing to be sets, the most important of these being perhaps that it makes the machinery of classes available for the formalization of much recent and very interesting work in set theory without threatening the universality of the theory as the most comprehensive theory of collections, when these are understood as objects. (shrink)

This paper contains a corrected proof that the statement “every non-empty closed subset of a compact complete separable metric space is separably closed” implies the arithmetical comprehension axiom of reverse mathematics.

We characterize the proof-theoretic strength of systems of explicit mathematics with a general principle asserting the existence of least fixed points for monotone inductive definitions, in terms of certain systems of analysis and set theory. In the case of analysis, these are systems which contain the Σ12-axiom of choice and Π12-comprehension for formulas without set parameters. In the case of set theory, these are systems containing the Kripke-Platek axioms for a recursively inaccessible universe together with the existence of (...) a stable ordinal. In all cases, the exact strength depends on what forms of induction are admitted in the respective systems. (shrink)

We present a new unified framework for formalizations of axiomatic set theories of different strength, from rudimentary set theory to full ZF . It allows the use of set terms, but provides a static check of their validity. Like the inconsistent “ideal calculus” for set theory, it is essentially based on just two set-theoretical principles: extensionality and comprehension (to which we add ∈-induction and optionally the axiom of choice). Comprehension is formulated as: x ∈ {x | ϕ} (...) ↔ ϕ, where {x | ϕ} is a legal set term of the theory. In order for {x | ϕ} to be legal, ϕ should be safe with respect to {x}, where safety is a relation between.. (shrink)

In [10] Friedman showed that is a conservative extension of <ε0for-sentences wherei= min, i.e.,i= 2, 3, 4 forn= 0, 1, 2 +m. Feferman [5], [7] and Tait [11], [12] reobtained this result forn= 0, 1 and even with instead of. Feferman and Sieg established in [9] the conservativeness of over <ε0for-sentences for alln. In each paper, different methods of proof have been used. In particular, Feferman and Sieg showed how to apply familiar proof-theoretical techniques by passing through languages with Skolem (...) functionals.In this paper we study the same choice principles in the presence of theBar Rule, which permits one to infer the scheme of transfinite induction on a primitive recursive relation ≺ when it has been proved that ≺ is wellfounded. The main result characterizes + as a conservative extension of a system of the autonomously iterated-comprehension axiom for-sentences. Forn= 0 this has been proved by Feferman in the form that + is a conservative extension of <Γ0; this was first done in [8] by use of the Gödel functional interpretation for the stronger systemZω+μ+ + and then more recently by the simpler methods of [9]. Jäger showed how the latter methods could also be used to obtain the general result of Theorem 1 below. (shrink)

This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries. Chapter 2 is devoted to the axiomatization of urelement set theory, where I introduce a hierarchy of axioms and discuss how ZFC with urelements should be axiomatized. The breakdown of this hierarchy of axioms in the absence of the Axiom of Choice is also explored. In (...) Chapter 3, I investigate forcing with urelements and develop a new approach that addresses a drawback of the existing machinery. I demonstrate that forcing can preserve, destroy, and recover the axioms isolated in Chapter 2 and discuss how Boolean ultrapowers can be applied in urelement set theory. Chapter 4 delves into class theory with urelements. I first discuss the issue of axiomatizing urelement class theory and then explore the second-order reflection principle with urelements. In particular, assuming large cardinals, I construct a model of second-order reflection where the principle of limitation of size fails. (shrink)