A paradox about sets of properties is presented. The paradox, which invokes an impredicatively defined property, is formalized in a free third-order logic with lambda-abstraction, through a classically proof-theoretically valid deduction of a contradiction from a single premise to the effect that every property has a unit set. Something like a model is offered to establish that the premise is, although classically inconsistent, nevertheless consistent, so that the paradox discredits the logic employed. A resolution through the ramified theory of types (...) is considered. Finally, a general scheme that generates a family of analogous paradoxes and a generally applicable resolution are proposed. (shrink)

This brief note corrects an error in one of the reduction steps in my paper 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks' published in the Journal of Applied Logics 8/2 (2021): 531-556.

Predicativity is a notable example of fruitful interaction between philosophy and mathematical logic. It originated at the beginning of the 20th century from methodological and philosophical reflections on a changing concept of set. A clarification of this notion has prompted the development of fundamental new technical instruments, from Russell's type theory to an important chapter in proof theory, which saw the decisive involvement of Kreisel, Feferman and Schütte. The technical outcomes of predica-tivity have since taken a life of their own, (...) but have also produced a deeper understanding of the notion of predicativity, therefore witnessing the " light logic throws on problems in the foundations of mathematics. " (Feferman 1998, p. vii) Predicativity has been at the center of a considerable part of Feferman's work: over the years he has explored alternative ways of explicating and analyzing this notion and has shown that predicative mathematics extends much further than expected within ordinary mathematics. The aim of this note is to outline the principal features of predicativity, from its original motivations at the start of the past century to its logical analysis in the 1950-60's. The hope is to convey why predicativity is a fascinating subject, which has attracted Feferman's attention over the years. (shrink)

Most paradoxes of self-reference have a dual or ‘hypodox’. The Liar paradox (Lr = ‘Lr is false’) has the Truth-Teller (Tt = ‘Tt is true’). Russell’s paradox, which involves the set of sets that are not self-membered, has a dual involving the set of sets which are self-membered, etc. It is widely believed that these duals are not paradoxical or at least not as paradoxical as the paradoxes of which they are duals. In this paper, I argue that some paradox’s (...) duals or hypodoxes are as paradoxical as the paradoxes of which they are duals, and that they raise neglected and interestingly different problems. I first focus on Richard’s paradox (arguably the simplest case of a paradoxical dual), showing both that its dual is as paradoxical as Richard’s paradox itself, and that the classical, Richard-Poincaré solution to the latter does not generalize to the former in any obvious way. I then argue that my argument applies mutatis mutandis to other paradoxes of self-reference as well, the dual of the Liar (the Truth-Teller) proving paradoxical. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based on (...) the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (shrink)

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...) Lemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effectivization by Borel, Lusin, Addison, and others. (shrink)

The aim of the paper is to discuss the influence exercised by Russell's thought inGöttingen in the period leading to the formulation of Hilbert's program in theearly twenties. I show that after a period of intense foundational work, culminatingwith the departure from Göttingen of Zermelo and Grelling in 1910 we witnessa reemergence of interest in foundations of mathematics towards the end of 1914. Itis this second period of foundational work that is my specific interest. Through theuse of unpublished archival sources (...) I will describe how Hilbert, Behmann, and Bernays,among others, were influenced by and reacted to the technical and philosophical thesespresented in Principia Mathematica. I also argue that there are some elements of continuity between Russell's approach and Hilbert's program as it was presented inthe early twenties. (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)

In 1909 A. Koyré (1892–1964) came to Göttingen as an exile and there became a student of Edmund Husserl and other philosophers (A. Reinach, M. Scheler): already before leaving his country Russia Koyré read Husserl'sLogical Investigations, a text which interested greatly Russian philosophers and was translated into Russian in the same year. As many other contemporary philosophers, in Göttingen they were discussing on the fundaments of mathematic, Cantor's set theory and Russell's antinomies. On this problems Koyré wrote a long paper (...) inspired to Husserl'sLogical Investigations, read it in the Philosophical Society at Göttingen and submitted it as draft for his Ph.D. dissertation to Prof. Husserl, who refused it. So unhappily the celebrated methodologist and historian of science began his academical career: Koyré came back to write on logical and mathematical paradoxes in 1922 and in 1946–47 saying he was “going back to his first love”. Among other factors this deep interest in mathematic and exact sciences unabled Koyré to analyze Galileo and Newton in his masterly way. (shrink)

To borrow a colorful phrase from Kant, this dissertation offers a prolegomenon to any future semantic theory. The dissertation investigates Yablo's omega-liar paradox and draws the following consequence. Any semantic theory that accepts the existence of semantic objects must face Yablo's paradox. The dissertation endeavors to position Yablo's omega-liar in a role analogous to that which Russell's paradox has for the foundations of mathematics. Russell's paradox showed that if we wed mathematics to sets, then because of the many different possible (...) restrictions available for blocking the paradox, mathematics fractionates. There would be different mathematics. This is intolerable. It is similarly intolerable to have restrictions on the `objects' of Intentionality. Hence, in the light of Yablo's omega-liar, Intentionality cannot be wed to any theory of semantic objects. We ought, therefore, to think of Yablo's paradox as a natural language paradox, and as such we must accept its implications for the semantics of natural language, namely that those entities which are `meanings' must not be construed as objects. To establish our result, Yablo's paradox is examined in light of the criticisms of Priest. Priest maintains that Yablo's original omega-liar is flawed in its employment of a Tarski-style T-schema for its truth-predicate. Priest argues that the paradox is not formulable unless it employs a "satisfaction" predicate in place of its truth-predicate. Priest is mistaken. However, it will be shown that the omega-liar paradox depends essentially on the assumption of semantic objects. No formulation of the paradox is possible without this assumption. Given this, the dissertation looks at three different sorts of theories of propositions, and argues that two fail to specify a complete syntax for the Yablo sentences. Purely intensional propositions, however, are able to complete the syntax and thus generate the paradox. In the end, however, the restrictions normally associated with purely intensional propositions begin to look surprisingly like the hierarchies that Yablo sought to avoid with his paradox. The result is that while Yablo's paradox is syntactically formable within systems with formal hierarchies, it is not semantically so. (shrink)

Set theory, it has been contended, developed from its beginnings through a progression ofmathematicalmoves, despite being intertwined with pronounced metaphysical attitudes and exaggerated foundational claims that have been held on its behalf. In this paper, the seminal results of set theory are woven together in terms of a unifying mathematical motif, one whose transmutations serve to illuminate the historical development of the subject. The motif is foreshadowed in Cantor's diagonal proof, and emerges in the interstices of the inclusion vs. membership (...) distinction, a distinction only clarified at the turn of this century, remarkable though this may seem. Russell runs with this distinction, but is quickly caught on the horns of his well-known paradox, an early expression of our motif. The motif becomes fully manifest through the study of functionsof the power set of a set into the set in the fundamental work of Zermelo on set theory. His first proof in 1904 of his Well-Ordering Theoremis a central articulation containing much of what would become familiar in the subsequent development of set theory. Afterwards, the motif is cast by Kuratowski as a fixed point theorem, one subsequently abstracted to partial orders by Bourbaki in connection with Zorn's Lemma. Migrating beyond set theory, that generalization becomes cited as the strongest of fixed point theorems useful in computer science.Section 1 describes the emergence of our guiding motif as a line of development from Cantor's diagonal proof to Russell's Paradox, fueled by the clarification of the inclusion vs. membership distinction. Section 2 engages the motif as fully participating in Zermelo's work on the Well-Ordering Theorem and as newly informing on Cantor's basic result that there is no bijection. Then Section 3 describes in connection with Zorn's Lemma the transformation of the motif into an abstract fixed point theorem, one accorded significance in computer science. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Prompted by Poincaré, Russell put forward his celebrated vicious-circle principle (vcp) as the solution to the modern paradoxes. Ramsey, Gödel, and Quine, among others, have raised two salient objections against Russell's vcp. First, Gödel has claimed that Russell's various renderings of the vcp really express distinct principles and thus, distinct solutions to the paradoxes, a claim that gainsays one of Russell's positions on the nature of the solution to the paradoxes, namely, that such a solution be uniform. Secondly, Ramsey, Gödel, (...) and Quine have protested that the vcp's proscription against impredicative specification is incompatible with a realistic conception of the domain of quantification, a conception that Russell certainly held. I examine Russell's vcp and defend it against these objections. (shrink)

In a definition (∀ x )(( x є r )↔D[ x ]) of the set r, the definiens D[ x ] must not depend on the definiendum r . This implies that all quantifiers in D[ x ] are independent of r and of (∀ x ). This cannot be implemented in the traditional first-order logic, but can be expressed in IF logic. Violations of such independence requirements are what created the typical paradoxes of set theory. Poincaré’s Vicious Circle Principle (...) was intended to bar such violations. Russell nevertheless misunderstood the principle; for him a set a can depend on another set b only if ( b є a ) or ( b ⊆ a ). Likewise, the truth of an ordinary first-order sentence with the Gödel number of r is undefinable in Tarki’s sense because the quantifiers of the definiens depend unavoidably on r. (shrink)

Theories about the ontological structure of the world have generally been described in informal, intuitive terms. This book offers an account of the general features and methodology of formal ontology. The book defends conceptual realism as the best system to adopt based on a logic of natural kinds. By formally reconstructing an intuitive, informal ontological scheme as a formal ontology we can better determine the consistency and adequacy of that scheme.

This is the Spanish translation, by Valeria Sol Valiño, of Rudolf Carnap’s classical text “Die logizistische Grundlegung der Mathematik”, which was originally presented at the Königsberg’s Symposium on Philosophy of Mathematics in 1930, and finally published in Erkenntnis in 1931.

This paper presents and comments the content of a note by Beppo Levi on logical paradoxes. Though the existence of this contribution is known, very little analysis of it is available in the literature. I put the emphasis on Levi’s usage of “elementation procedures” for solving the set-theoretical paradoxes, which is the most original part of Levi’s approach to the topic.

This paper surveys the interactions between Russell and Gödel, both personal and intellectual. After a description of Russell’s influence on Gödel, it concludes with a discussion of Russell’s reaction to the incompleteness theorems.