We provide infinitary proof theories for three common semantic theories of truth: strong Kleene, van Fraassen supervaluation and Cantini supervaluation. The value of these systems is that they provide an easy method of proving simple facts about semantic theories. Moreover we shall show that they also give us a simpler understanding of the computational complexity of these definitions and provide a direct proof that the closure ordinal for Kripke’s definition is $\omega _1^{CK}$. This work can be understood as an effort to provide a proof-theoretic counterpart to Welch’s game-theoretic (Welch, 2009).

In an earlier paper in this journal I provided detailed motivation for the constructive and relevant system of Core Logic; explained its main features; and established that, even though Cut is not a rule of the system, nevertheless Cut is admissible for it, and indeed with potential epistemic gain. If Π is a proof of the sequent Δ : A, and Σ is a proof of the sequent Г, A : θ, then there is a computable reduct [Π, Σ] of some subsequent of the ‘overall target sequent’ Δ, Г : θ. In the constructive case the potential epistemic gain consists in the possibility that the subsequent in question be a proper subsequent of Δ, Г : θ, and indeed even logically stronger than Δ, Г : θ.

In this paper it is established that Cut is likewise admissible for Classical Core Logic, which is obtained from Core Logic by adding a suitably relevantized form of the rule of Classical Dilemma. In the classical case there is an additional feature of potential epistemic gain: the proof [Π, Σ] might have a lower degree of non-constructivity than do Π and Σ.

We discuss the interplay between the axiomatic and the semantic approach to truth. Often, semantic constructions have guided the development of axiomatic theories and certain axiomatic theories have been claimed to capture a semantic construction. We ask under which conditions an axiomatic theory captures a semantic construction. After discussing some potential criteria, we focus on the criterion of ℕ-categoricity and discuss its usefulness and limits.

Dialetheism is the metaphysical claim that there are true contradictions. And based on this view, Graham Priest and his collaborators have been suggesting solutions to a number of paradoxes. Those paradoxes include Russell’s paradox in naive set theory. For the purpose of dealing with this paradox, Priest is known to have argued against the presence of classical negation in the underlying logic of naive set theory. The aim of the present paper is to challenge this view by showing that there is a way to handle classical negation.

The paper proposes an extension of the definition of a canonical proof, central to proof-theoretic semantics, to a definition of a canonical derivation from open assumptions. The impact of the extension on the definition of (reified) proof-theoretic meaning of logical constants is discussed. The extended definition also sheds light on a puzzle regarding the definition of local-completeness of a natural-deduction proof-system, underlying its harmony.

The big question at the end of Feferman (2013) is: Is it possible to find a foundation for unlimited category theory? I show that the answer is no by showing that unlimited category theory is inconsistent.

Bertrand Russell offered an influential paradox of propositions in Appendix B of The Principles of Mathematics, but there is little agreement as to what to conclude from it. We suggest that Russell’s paradox is best regarded as a limitative result on propositional granularity. Some propositions are, on pain of contradiction, unable to discriminate between classes with different members: whatever they predicate of one, they predicate of the other. When accepted, this remarkable fact should cast some doubt upon some of the uses to which modern descendants of Russell’s paradox of propositions have been put in recent literature.

There are two perspectives from which formal theories can be viewed. On the one hand, one can take a theory to be about some privileged models. On the other hand, one can take all models of a theory to be on a par. In contrast with what is usually done in philosophical debates, we adopt the latter viewpoint. Suppose that from this perspective we want to add an adequate truth predicate to a background theory. Then on the one hand the truth theory ought to be semantically conservative over the background theory. At the same time, it is generally recognised that the central function of a truth predicate is an expressive one. A truth predicate ought to allow us to express propositions that we could not express before. In this article we argue that there are indeed natural truth theories which satisfy both the demand of semantical conservativeness and the demand of adequately extending the expressive power of our language.

In a recent article (Mancosu, 2009), I have explored the historical, mathematical, and philosophical issues related to the new theory of numerosities. The theory of numerosities provides a context in which to assign ‘sizes’ to infinite sets of natural numbers in such a way as to preserve the part-whole principle, namely if a set A is properly included in B then the numerosity of A is strictly less than the numerosity of B. Numerosity assignments differ from the standard assignment of size provided by Cantor’s cardinality assignments. In this paper I generalize some worries, raised by Richard Heck, emerging from the theory of numerosities to a line of thought resulting in what I call a ‘good company’ objection to Hume’s Principle (HP). The paper is centered around five main parts. The first (§3) takes a historical look at nineteenth-century attributions of equality of numbers in terms of one-one correlation and argues that there was no agreement as to how to extend such determinations to infinite sets of objects. This leads to the second part (§4) where I show that there are countably-infinite many abstraction principles that are ‘good’, in the sense that they share the same virtues of HP (or so I claim) and from which we can derive the axioms of second-order arithmetic. All the principles I present agree with HP in the assignment of numbers to finite concepts but diverge from it in the assignment of numbers to infinite concepts. The third part (§5) connects this material to a debate on Finite Hume’s Principle between Heck and MacBride. The fourth part (§6) states the ‘good company’ objection as a generalization of Heck’s objection to the analyticity of HP based on the theory of numerosities. In the same section I offer a taxonomy of possible neo-logicist responses to the ‘good company’ objection. Finally, §7 makes a foray into the relevance of this material for the issue of cross-sortal identifications for abstractions.