Weak enough relevant logics are often closed under depth substitutions. To determine the breadth of logics with this feature, we show there is a largest sublogic of R closed under depth substitutions and that this logic can be recursively axiomatized.

In a recent paper , Urbaniak and Cieśliński describe an analogue of the Yablo Paradox, in the domain of formal provability. Just as the infinite sequence of Yablo sentences inherit the paradoxical behavior of the liar sentence, an infinite sequence of sentences can be constructed that inherit the distinctive behavior of the Gödel sentence. This phenomenon—the transfer of the properties of self-referential sentences of formal mathematics to their “unwindings” into infinite sequences of sentences—suggests a number of interesting logical questions. The (...) purpose of this paper is to give a precise statement of a conjecture from Cieśliński and Urbaniak regarding the unwinding of the Rosser sentence, and to demonstrate that this precise statement is false. We begin with some preliminary motivation, introduce the conjecture against the background of some related results, and finally, in the last section, move on to the proof, which adapts a method used by Solovay and Guaspari. (shrink)

The paradox that appears under Burali-Forti’s name in many textbooks of set theory is a clever piece of reasoning leading to an unproblematic theorem. The theorem asserts that the ordinals do not form a set. For such a set would be—absurdly—an ordinal greater than any ordinal in the set of all ordinals. In this article, we argue that the paradox of Burali-Forti is first and foremost a problem about concept formation by abstraction, not about sets. We contend, furthermore, that some (...) hundred years after its discovery the paradox is still without any fully satisfactory resolution. A survey of the current literature reveals one key assumption of the paradox that has gone unquestioned, namely the assumption that ordinals are objects. Taking the lead from Russell’s no class theory, we interpret talk of ordinals as an efficient way of conveying higher-order logical truths. The resulting theory of ordinals is formally adequate to standard intuitions about ordinals, expresses a conception of ordinal number capable of resolving Burali-Forti’s paradox, and offers a novel contribution to the longstanding program of reducing mathematics to higher-order logic. (shrink)

In this paper, I present a class of ‘structural’ abstraction principles, and describe how they are suggested by some features of Cantor's and Dedekind's approach to abstraction. Structural abstraction is a promising source of mathematically tractable new axioms for the neo-logicist. I illustrate this by showing, first, how a theorem of Shelah gives a sufficient condition for consistency in the structural setting, solving what neo-logicists call the ‘bad company’ problem for structural abstraction. Second, I show how, in the structural setting, (...) we can measure the logical strength of abstraction principles using categories of interpretations between theories. (shrink)

Categorial logic, as its name suggests, applies the techniques and machinery of category theory to topics traditionally classified as part of logic. We claim that these tools deserve attention from a greater range of philosophers than just the mathematical logicians. We support this claim with an example. In this paper we show how one particular tool from categorial logic---hyperdoctrines---suggests interesting metaphysics. Hyperdoctrines can provide semantics for quantified languages, but this account of quantification suggests a metaphysical picture quite different from the (...) one suggested by standard model-theoretic semantics. (shrink)

This paper presents an overview of Carnap, a free and open framework for the development of formal reasoning applications. Carnap’s design emphasizes flexibility, extensibility, and rapid prototyping. Carnap-based applications are written in Haskell, but can be compiled to JavaScript to run in standard web browsers. This combination of features makes Carnap ideally suited for educational applications, where ease-of-use is crucial for students and adaptability to different teaching strategies and classroom needs is crucial for instructors. The paper describes Carnap’s implementation, along (...) with its current and projected pedagogical applications. (shrink)

Russell’s paradox is purely logical in the following sense: a contradiction can be formally deduced from the proposition that there is a set of all non-self-membered sets, in pure first-order logic—the first-order logical form of this proposition is inconsistent. This explains why Russell’s paradox is portable—why versions of the paradox arise in contexts unrelated to set theory, from propositions with the same logical form as the claim that there is a set of all non-self-membered sets. Burali-Forti’s paradox, like Russell’s paradox, (...) is portable. I offer the following explanation for this fact: Burali-Forti’s paradox, like Russell’s, is purely logical. Concretely, I show that if we enrich the language \ of first-order logic with a well-foundedness quantifier W and adopt certain minimal inference rules for this quantifier, then a contradiction can be formally deduced from the proposition that there is a greatest ordinal. Moreover, a proposition with the same logical form as the claim that there is a greatest ordinal can be found at the heart of several other paradoxes that resemble Burali-Forti’s. The reductio of Burali-Forti can be repeated verbatim to establish the inconsistency of these other propositions. Hence, the portability of the Burali-Forti’s paradox is explained in the same way as the portability of Russell’s: both paradoxes involve an inconsistent logical form—Russell’s involves an inconsistent form expressible in \ and Burali-Forti’s involves an inconsistent form expressible in \. (shrink)

Frege’s Basic Law V and its successor, Boolos’s New V, are axioms postulating abstraction operators: mappings from the power set of the domain into the domain. Basic Law V proved inconsistent. New V, however, naturally interprets large parts of second-order ZFC via a construction discovered by Boolos in 1989. This paper situates these classic findings about abstraction operators within the general theory of F-algebras and coalgebras. In particular, we show how Boolos’s construction amounts to identifying an initial F-algebra in a (...) certain category, we identify a natural coalgebraic dual to Boolos’s axiom which naturally interprets large parts of Aczel’s non-well-founded set theory via the construction of a certain terminal F-coalgebra, and we suggest a coalgebraic way forward for an abstraction-theoretic axiomatization of the real numbers. (shrink)

It’s well known that it’s possible to extract, from Frege’s Grudgesetze, an interpretation of second-order Peano Arithmetic in the theory  HP2, whose sole axiom is Hume’s principle. What’s less well known is that, in Die Grundlagen Der Arithmetic §82–83 Boolos (2011), George Boolos provided a converse interpretation of HP2 in PA2 . Boolos’ interpretation can be used to show that the Frege’s construction allows for any model of PA2 to be recovered from some model of HP2. So the space (...) of possible arithmetical universes is precisely characterized by Hume’s principle. -/- In this paper, I show that a large class of second-order theories admit characterization by an abstraction principle in this sense. The proof makes use of structural abstraction principles, a class of abstraction principles of considerable intrinsic interest, and categories of interpretations in the sense of Visser (2003). (shrink)