Set Theory as a Foundation

John P. Burgess is the John N. Woodhull Professor of Philosophy at Princeton University. He obtained his Ph.D. from the Logic and Methodology program at the University of California at Berkeley under the supervision of Jack H. Silver with a thesis on descriptive set theory. He is a very distinguished and influential philosopher of mathematics. He has written several books: A Subject with No Object (with G. Rosen, Oxford University Press, 1997), Computability and Logic (with G. Boolos and R. Jeffrey, (...) 5th ed., Cambridge University Press, 2007), Fixing Frege (Princeton University Press, 2005), Mathematics, Models, and Modality (Cambridge University Press, 2007), Philosophical Logic (Princeton University Press, 2009), Truth (with A. G. Burgess, Princeton University Press, 2011), Saul Kripke: Puzzles & Mysteries (Polity Press, 2012), Rigor & Structure (Oxford University Press, 2015), and Set Theory (Cambridge Elements, Forthcoming). In this interview, Professor Burgess talks about how his interests in mathematics and philosophy developed and relate to each other. He then answers questions about specific themes of his philosophical work, with a focus on issues pertaining to philosophy of mathematics. (shrink)

In this paper, I argue that one of the arguments usually put forward in defence of universism is in tension with current set theoretic practice. According to universism, there is only one set theoretic universe, V, and when applying the method of forcing we are not producing new universes, but only simulating them inside V. Since the usual interpretation of set generic forcing is used to produce a “simulation” of an extension of V from a countable set inside V itself, (...) the above argument is credited to be a strong defence of universism. However, I claim, such an argument does not take into account current mathematical practice. Indeed, it is possible to find theorems that are available to the multiversists but that the advocate of universism cannot prove. For example, it is possible to prove results on infinite games in non-well-founded set-theories plus the axiom of determinacy (such as ZF + AFA + PD) that are not available in ZFC + PD. These results, I contend, are philosophically problematic on a strict universist approach to forcing. I suggest that the best way to avoid the difficulty is to adopt a pluralist conception of set theory and embrace a set theoretic multiverse. Consequently, the current practice of set generic forcing better supports a multiverse conception of set theory. (shrink)

The Forrest-Armstrong argument, as reconfigured by David Lewis, is a reductio against an unrestricted principle of recombination. There is a gap in the argument which Lewis thought could be bridged by an appeal to recombination. After presenting the argument, I show that no plausible principle of recombination can bridge the gap. But other plausible principles of plenitude can bridge the gap, both principles of plenitude for world contents and principles of plenitude for world structures. I conclude that the Forrest-Armstrong argument, (...) when fortified in one of these ways, demands that unrestricted recombination be rejected. The appropriate restriction comes from a consideration of what world structures are possible. I argue that, although there are too many worlds to form a set, for any world, the individuals at that world do form a set. To defend it I invoke a principle of Limitation of Size together with an iterative conception of structure. (shrink)

Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness results as to Peano arithmetic. Quantum mechanics involves infinity by Hilbert space, but it is finitist as any experimental science. The absence of hidden variables in it interpretable as its completeness should resurrect Hilbert’s finitism at the cost of relevant modification of the latter already hinted by intuitionism and Gentzen’s approaches for completeness. This paper (...) investigates both conditions and philosophical background necessary for that modification. The main conclusion is that the concept of infinity as underlying contemporary mathematics cannot be reduced to a single Peano arithmetic, but to at least two ones independent of each other. Intuitionism, quantum mechanics, and Gentzen’s approaches to completeness an even Hilbert’s finitism can be unified from that viewpoint. Mathematics may found itself by a way of finitism complemented by choice. The concept of information as the quantity of choices underlies that viewpoint. Quantum mechanics interpretable in terms of information and quantum information is inseparable from mathematics and its foundation. (shrink)

This edited work presents contemporary mathematical practice in the foundational mathematical theories, in particular set theory and the univalent foundations. It shares the work of significant scholars across the disciplines of mathematics, philosophy and computer science. Readers will discover systematic thought on criteria for a suitable foundation in mathematics and philosophical reflections around the mathematical perspectives. The first two sections focus on the two most prominent candidate theories for a foundation of mathematics. Readers may trace current research in set theory, (...) which has widely been assumed to serve as a framework for foundational issues, as well as new material elaborating on the univalent foundations, considering an approach based on homotopy type theory (HoTT). The further sections then build on this and are centred on philosophical questions connected to the foundations of mathematics. Here, the authors contribute to discussions on foundational criteria with more general thoughts on the foundations of mathematics which are not connected to particular theories. This book shares the work of some of the most important scholars in the fields of set theory (S. Friedman), non-classical logic (G. Priest) and the philosophy of mathematics (P. Maddy). The reader will become aware of the advantages of each theory and objections to it as a foundation, following the latest and best work across the disciplines and it is therefore a valuable read for anyone working on the foundations of mathematics or in the philosophy of mathematics. (shrink)

Categorical foundations and set-theoretical foundations are sometimes presented as alternative foundational schemes. So far, the literature has mostly focused on the weaknesses of the categorical foundations. We want here to concentrate on what we take to be one of its strengths: the explicit identification of so-called canonical maps and their role in mathematics. Canonical maps play a central role in contemporary mathematics and although some are easily defined by set-theoretical tools, they all appear systematically in a categorical framework. The key (...) element here is the systematic nature of these maps in a categorical framework and I suggest that, from that point of view, one can see an architectonic of mathematics emerging clearly. Moreover, they force us to reconsider the nature of mathematical knowledge itself. Thus, to understand certain fundamental aspects of mathematics, category theory is necessary (at least, in the present state of mathematics). (shrink)

Dummett’s notion of indefinite extensibility is influential but obscure. The notion figures centrally in an alternative Dummettian argument for intuitionistic logic and anti-realism, distinct from his more famous, meaning-theoretic arguments to the same effect. Drawing on ideas from Dummett, a precise analysis of indefinite extensibility is proposed. This analysis is used to reconstruct the poorly understood alternative argument. The plausibility of the resulting argument is assessed.

We present an extension of constructive Zermelo{Fraenkel set theory [2]. Constructive sets are endowed with an applicative structure, which allows us to express several set theoretic constructs uniformly and explicitly. From the proof theoretic point of view, the addition is shown to be conservative. In particular, we single out a theory of constructive sets with operations which has the same strength as Peano arithmetic.

We introduce an operational set theory in the style of [5] and [16]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical of explicit mathematics [14]. In particular, one has non-extensional operations (or rules) alongside extensional constructive sets. Operations are in general partial and a limited form of self{application is permitted. The system we (...) introduce here is a fully explicit, nitely axiomatised system of constructive sets and operations, which is shown to be as strong as HA. (shrink)

Brief note explaining the content, importance, and historical context of my joint translation of Quine's The Significance of the New Logic with my single-authored historical-philosophical essay 'Willard Van Orman Quine's Philosophical Development in the 1930s and 1940s'.

Confronted with Russell's Paradox, Frege wrote an appendix to volume II of his _Grundgesetze der Arithmetik_. In it he offered a revision to Basic Law V, and proclaimed with confidence that the major theorems for arithmetic are recoverable. This paper shows that Frege's revised system has been seriously undermined by interpretations that transcribe his system into a predicate logic that is inattentive to important details of his concept-script. By examining the revised system as a concept-script, we see how Frege imagined (...) that minor modifications of his former proofs would recover arithmetic. (shrink)

The paper discusses some different conceptions of the infinity, from Aristotle to Georg Cantor (1845-1918) and beyond. The ancient distinction between actual and potential infinity is explained, along with some arguments against the possibility of actually infinite collections. These arguments were eventually rejected by most philosophers and mathematicians as a result of Cantor’s elegant and successful theory of actually infinite collections.

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.

Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law V from Frege's Grundgesetze. In this paper we study the strength of abstraction principles in the presence of predicative restrictions on the comprehension schema, and in particular we study a predicative Fregean theory which contains all the abstraction principles whose underlying equivalence relations can be proven to be equivalence (...) relations in a weak background second-order logic. We show that this predicative Fregean theory interprets second-order Peano arithmetic. (shrink)

Some reasons to regard the cumulative hierarchy of sets as potential rather than actual are discussed. Motivated by this, a modal set theory is developed which encapsulates this potentialist conception. The resulting theory is equi-interpretable with Zermelo Fraenkel set theory but sheds new light on the set-theoretic paradoxes and the foundations of set theory.

outrageous remarks about contradictions. Perhaps the most striking remark he makes is that they are not false. This claim first appears in his early notebooks (Wittgenstein 1960, p.108). In the Tractatus, Wittgenstein argued that contradictions (like tautologies) are not statements (Sätze) and hence are not false (or true). This is a consequence of his theory that genuine statements are pictures.

In his paper “St. Anselm’s ontological argument succumbs to Russell’s paradox” Christopher Viger presents a critique of Anselm’s Argument from the second chapter of Proslogion. Viger claims there that he manages to show that the greater than relation that Anselm used in his proof leads to inconsistency. I argue firstly, that Viger does not show what he maintains to show, secondly, that the flaw is not in the nature of Anselm’s reasoning but in Viger’s (mis)understanding of Anselm as well as (...) in Viger’s (mis)application of some set-theoretical notions. I also describe some features of Anselmian greater than relation, which indeed plays a crucial role in his Ontological Argument. Last but not least, I present the Argument itself. (shrink)

The actions of perceiving and grouping are the two that the human being carries out when thinking in entities different from himself. In this article “The Mirror Problem” and “The Peer Problem”, which correspond respectively to self-perception and the perception of others, are studied. By solving these two problems, the thinker arrives to the following conclusions: “I exist” and “I am”.

In 1903, in The Principles of Mathematics (PoM), Russell endorsed an account of classes whereupon a class fundamentally is to be considered many things, and not one, and used this thesis to explicate his first version of a theory of types, adding that it formed the logical justification for the grammatical distinction between singular and plural. The view, however, was short-lived; rejected before PoM even appeared in print. However, aside from mentions of a few misgivings, there is little evidence about (...) why he abandoned this view. In this paper, I speculate as to what those reasons were, and evaluate them in light of recent work and interest in plural logic. (shrink)

This book will appeal to mathematicians and philosophers interested in the foundations of mathematics.

As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell?s Paradox being derivable in it.This system is, except for minor differences, full second-order logic, augmented by a single non-logical axiom, Frege?s Axiom V. It has been known for some time now that the first-order fragment of the theory is consistent. The present paper establishes that both the simple and the ramified predicative second-order fragments are consistent, and that Robinson arithmetic, Q, is (...) relatively interpretable in the simple predicative fragment. The philosophical significance of the result is discussed. (shrink)

There is an apparent tension between the open-ended aspect of the ordinal sequence and the assumption that the set-theoretical universe is fully determinate. This tension is already present in Cantor, who stressed the incompletable character of the transfinite number sequence in Grundlagen and avowed the definiteness of the totality of sets and numbers in subsequent philosophical publications and in correspondence. The tension is particularly discernible in his late distinction between sets and inconsistent multiplicities. I discuss Cantor’s contrasting views, and I (...) conclude that his account of that distinction is only tenable if the definiteness of the set-theoretical universe is rejected. (shrink)

A plurality of approaches to foundational aspects of mathematics is a fact of life. Two loci of this are discussed here, the classicism/constructivism controversy over standards of proof, and the plurality of universes of discourse for mathematics arising in set theory and in category theory, whose problematic relationship is discussed. The first case illustrates the hypothesis that a sufficiently rich subject matter may require a multiplicity of approaches. The second case, while in some respects special to mathematics, raises issues of (...) ontological multiplicity and relativity encountered in the natural sciences as well. (shrink)

In this paper an attempt is made to present Skolem's argument, for the relativity of some set-theoretical notions as a sensible one. Skolem's critique of set theory is seen as part of a larger argument to the effect that no conclusive evidence has been given for the existence of uncountable sets. Some replies to Skolem are discussed and are shown not to affect Skolem's position, since they all presuppose the existence of uncountable sets. The paper ends with an assessment of (...) the assumptions on which Skolem's argument rests from a present-day perspective. (shrink)

Attempts to lay a foundation for the sciences based on modern mathematics are questioned. In particular, it is not clear that computer science should be based on set-theoretic mathematics. Set-theoretic mathematics has difficulties with its own foundations, making it reasonable to explore alternative foundations for the sciences. The role of computation within an alternative framework may prove to be of great potential in establishing a direction for the new field of computer science.Whitehead''s theory of reality is re-examined as a foundation (...) for the sciences. His theory does not simply attempt to add formal rigor to the sciences, but instead relies on the methods of the biological and social sciences to construct his world-view. Whitehead''s theory is a rich source of notions that are intended to explain every element of experience. It is a product of Whitehead''s earlier attempt to provide a mathematical foundation for the physical sciences and is still consistent with modern physics. (shrink)

The business of mathematics is definition and proof, and its foundations comprise the principles which govern them. Modern mathematics is founded upon set theory. In particular, both the axiomatic method and mathematical logic belong, by their very natures, to the theory of sets. Accordingly, foundational set theory is not, and cannot logically be, an axiomatic theory. Failure to grasp this point leads obly to confusion. The idea of a set is that of an extensional plurality, limited and definite in size, (...) composed of well defined objects.It is the extension of Greek notion of 'number' (arithmos) into Cantor's 'transfinite'. (shrink)

This essay defends the following two claims: (1) liraitation-of-size reasoning yields enough sets to meet the needs of most mathematicians; (2) set formation and mereological fusion share enough logical features to justify placing both in the genus composition (even when the components of a set are taken to be its members rather than its subsets).

The paper presents Alfred Tarski’s debate with the semantic antinomies: the basic Liar Paradox, and its more sophisticated versions, which are currently discussed in philosophy: Strengthen Liar Paradox, Cyclical Liar Paradox, Contingent Liar Paradox, Correct Liar Paradox, Card Paradox, Yablo’s Paradox and a few others. Since Tarski, himself did not addressed these paradoxes—neither in his famous work published in 1933, nor in later papers in which he developed the Semantic Theory of Truth—therefore, We try to defend his concept of truth (...) against these antinomies. It is demonstrated that Tarskian theory of truth is resistant to the paradoxes and it is still the best solution to avoid the antinomies and remain within a classical logic, that is, accepting the laws of noncontradiction, excluded middle, and the principle of bivalence. Thus, the goal of the paper is double—firstly, to show that none of the versions of the Liar Paradox’s is a serious threat to Tarski’s concept of truth, and secondly, that Semantic Theory of Truth allows to remain within classical logic, and at the same time, avoid antinomies—which makes it the most attractive among classical theories of truth. (shrink)

The present work outlines a logical and philosophical conception of propositions in relation to a group of puzzles that arise by quantifying over them: the Russell-Myhill paradox, the Prior-Kaplan paradox, and Prior's Theorem. I begin by motivating an interpretation of Russell-Myhill as depending on aboutness, which constrains the notion of propositional identity. I discuss two formalizations of of the paradox, showing that it does not depend on the syntax of propositional variables. I then extend to propositions a modal predicative response (...) to the paradoxes articulated by an abstraction principle for propositions. On this conception, propositions are “shadows” of the sentences that express them. Modal operators are used to uncover the implicit relation of dependence that characterizes propositions that are about propositions. The benefits of this approach are shown by application to other intensional puzzles. The resulting view is an alternative to the plenitudinous metaphysics of impredicative comprehension principles. (shrink)

Inspired by Cantor's Theorem (CT), orthodoxy takes infinities to come in different sizes. The orthodox view has had enormous influence in mathematics, philosophy, and science. We will defend the contrary view---Countablism---according to which, necessarily, every infinite collection (set or plurality) is countable. We first argue that the potentialist or modal strategy for treating Russell's Paradox, first proposed by Parsons (2000) and developed by Linnebo (2010, 2013) and Linnebo and Shapiro (2019), should also be applied to CT, in a way that (...) vindicates Countabilism. Our discussion dovetails with recent independently developed treatments of CT in Meadows (2015), Pruss (2020), and Scambler (2021), aimed at establishing the mathematical viability, and therefore epistemic possibility, of Countabilism. Unlike these authors, our goal isn't to vindicate the mathematical underpinnings of Countabilism. Rather, we aim to argue that, given that Countabilism is mathematically viable, Countabilism should moreover be regarded as true. After clarifying the modal content of Countabilism, we canvas some of Countabilism's many positive implications, including that Countabilism provides the best account of the pervasive independence phenomena in set theory, and that Countabilism has the power to defuse several persistent puzzles and paradoxes found in physics and metaphysics. We conclude that in light of its theoretical and explanatory advantages, Countabilism is more likely true than not. (shrink)

A resolution to the Russell Paradox is presented that is similar to Russell's “theory of types” method but is instead based on the definition of why a thing exists as described in previous work by this author. In that work, it was proposed that a thing exists if it is a grouping tying "stuff" together into a new unit whole. In tying stuff together, this grouping defines what is contained within the new existent entity. A corollary is that a thing, (...) such as a set, does not exist until after the stuff is tied together, or said another way, until what is contained within is completely defined. A second corollary is that after a grouping defining what is contained within is present and the thing exists, if one then alters what is tied together (e.g., alters what is contained within), the first existent entity is destroyed and a different existent entity is created. A third corollary is that a thing exists only where and when its grouping exists. Based on this, the Russell Paradox's set R of all sets that aren't members of themselves does not even exist until after the list of the elements it contains (e.g. the list of all sets that aren't members of themselves) is defined. Once this list of elements is completely defined, R then springs into existence. Therefore, because it doesn't exist until after its list of elements is defined, R obviously can't be in this list of elements and, thus, cannot be a member of itself; so, the paradox is resolved. This same type of reasoning is then applied to Godel's first Incompleteness Theorem. Briefly, while writing a Godel Sentence, one makes reference to a future, not yet completed and not yet existent sentence, G, that claims its unprovability. However, only once the sentence is finished does it become a new unit whole and existent entity called sentence G. If one then goes back in and replaces the reference to the future sentence with the future sentence itself, a totally different sentence, G1, is created. This new sentence G1 does not assert its unprovability. An objection might be that all the possibly infinite number of possible G-type sentences or their corresponding Godel numbers already exist somehow, so one doesn't have to worry about references to future sentences and springing into existence. But, if so, where do they exist? If they exist in a Platonic realm, where is this realm? If they exist pre-formed in the mind, this would seem to require a possibly infinite-sized brain to hold all these sentences. This is not the case. What does exist in the mind is the system for creating G-type sentences and their corresponding numbers. This mental system for making a G-type sentence is not the same as the G-type sentence itself just as an assembly line is not the same as a finished car. In conclusion, a new resolution of the Russell Paradox and some issues with proofs of Godel's First Incompleteness Theorem are described. (shrink)

The starting point of this paper is a claim defended most famously by Graham Priest: that given certain observed similarities between the set-theoretic and the semantic paradoxes, we should be looking for a ‘uniform solution’ to the members of both families. Despite its indisputable surface attractiveness, I argue that this claim hinges on a problematic reasoning move. This is seen most clearly, I suggest, when the claim and its underlying assumptions are examined by the lights of a novel, quite general (...) and, I contend, promising take on inter-theoretic analogy. The ensuing discussion is intended to serve as both a possible case study and a first step towards the broader aim of the paper: namely, to initiate a wider conversation on the methodology of paradox-solving on the one hand, and the use of inter-theoretic analogies on the other. (shrink)

I critically discuss Dale Jacquette’s Frege: A Philosophical Biography. First, I provide a short overview of Jacquette’s book. Second, I evaluate Jacquette’s interpretation of Frege’s three major works, Begriffsschrift, Grundlagen der Arithmetik and Grundgesetze der Arithmetik; and conclude that the author does not faithfully represent their content. Finally, I offer some technical and general remarks.

Plural expressions found in natural languages allow us to talk about many objects simultaneously. Plural logic — a logical system that takes plurals at face value — has seen a surge of interest in recent years. This book explores its broader significance for philosophy, logic, and linguistics. What can plural logic do for us? Are the bold claims made on its behalf correct? After introducing plural logic and its main applications, the book provides a systematic analysis of the relation between (...) this logic and other theoretical frameworks such as set theory, mereology, higher-order logic, and modal logic. The applications of plural logic rely on two assumptions, namely that this logic is ontologically innocent and has great expressive power. These assumptions are shown to be problematic. The result is a more nuanced picture of plural logic's applications than has been given thus far. Questions about the correct logic of plurals play a central role in the final chapters, where traditional plural logic is rejected in favor of a "critical" alternative. The most striking feature of this alternative is that there is no universal plurality. This leads to a novel approach to the relation between the many and the one. In particular, critical plural logic paves the way for an account of sets capable of solving the set-theoretic paradoxes. (shrink)

The paper addresses Leon Hen.kin's proposition as a " lighthouse", which can elucidate a vast territory of knowledge uniformly: logic, set theory, information theory, and quantum mechanics: Two strategies to infinity are equally relevant for it is as universal and t hus complete as open and thus incomplete. Henkin's, Godel's, Robert Jeroslow's, and Hartley Rogers' proposition are reformulated so that both completeness and incompleteness to be unified and thus reduced as a joint property of infinity and of all infinite sets. (...) However, only Henkin's proposition equivalent to an internal position to infinity is consistent . This can be retraced back to set theory and its axioms, where that of choice is a key. Quantum mechanics is forced to introduce infinity implicitly by Hilbert space, on which is founded its formalism. One can demonstrate that some essential properties of quantum information, entanglement, and quantum computer originate directly from infinity once it is involved in quantum mechanics. Thus, these phenomena can be elucidated as both complete and incomplete, after which choice is the border between them. A special kind of invariance to the axiom of choice shared by quantum mechanics is discussed to be involved that border between the completeness and incompleteness of infinity in a consistent way. The so-called paradox of Albert Einstein, Boris Podolsky, and Nathan Rosen is interpreted entirely in the same terms only of set theory. Quantum computer can demonstrate especially clearly the privilege of the internal position, or " observer'' , or "user" to infinity implied by Henkin's proposition as the only consistent ones as to infinity. An essential area of contemporary knowledge may be synthesized from a single viewpoint. (shrink)

The present paper deals with the ontological status of numbers and considers Frege ́s proposal in Grundlagen upon the background of the Post-Kantian semantic turn in analytical philosophy. Through a more systematic study of his philosophical premises, it comes to unearth a first level paradox that would unset earlier still than it was exposed by Russell. It then studies an alternative path, that departin1g from Frege’s initial premises, drives to a conception of numbers as synthetic a priori in a more (...) Kantian sense. On this basis, it tentatively explores a possible derivation of basic logical rules on their behalf, suggesting a more rudimentary basis to inferential thinking, which supports reconsidering the difference between logical thinking and AI. Finally, it reflects upon the contributions of this approach to the problem of the a priori. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

We defend hylomorphism against Maegan Fairchild’s purported proof of its inconsistency. We provide a deduction of a contradiction from SH+, which is the combination of “simple hylomorphism” and an innocuous premise. We show that the deduction, reminiscent of Russell’s Paradox, is proof-theoretically valid in classical higher-order logic and invokes an impredicatively defined property. We provide a proof that SH+ is nevertheless consistent in a free higher-order logic. It is shown that the unrestricted comprehension principle of property abstraction on which the (...) purported proof of inconsistency relies is analogous to naïve unrestricted set-theoretic comprehension. We conclude that logic imposes a restriction on property comprehension, a restriction that is satisfied by the ramified theory of types. By extension, our observations constitute defenses of theories that are structurally similar to SH+, such as the theory of singular propositions, against similar purported disproofs. (shrink)