One of the central logical ideas in Wittgenstein’s Tractatus logico-philosophicus is the elimination of the identity sign in favor of the so-called “exclusive interpretation” of names and quantifiers requiring different names to refer to different objects and (roughly) different variables to take different values. In this paper, we examine a recent development of these ideas in papers by Kai Wehmeier. We diagnose two main problems of Wehmeier’s account, the first concerning the treatment of individual constants, the second concerning so-called “pseudo-propositions” (Scheinsätze) of classical logic such as $a=a$ or $a=b \wedge b=c \rightarrow a=c$ . We argue that overcoming these problems requires two fairly drastic departures from Wehmeier’s account: (1) Not every formula of classical first-order logic will be translatable into a single formula of Wittgenstein’s exclusive notation. Instead, there will often be a multiplicity of possible translations, revealing the original “inclusive” formulas to be ambiguous. (2) Certain formulas of first-order logic such as $a=a$ will not be translatable into Wittgenstein’s notation at all, being thereby revealed as nonsensical pseudo-propositions which should be excluded from a “correct” conceptual notation. We provide translation procedures from inclusive quantifier-free logic into the exclusive notation that take these modifications into account and define a notion of logical equivalence suitable for assessing these translations.

This paper starts from the observation that the standard arguments for compositionality are really arguments for the computability of semantics. Since computability does not entail compositionality, the question of what justifies compositionality recurs. The paper then elaborates on the idea of recursive semantics as corresponding to computable semantics. It is then shown by means of time complexity theory and with the use of term rewriting as systems of semantic computation, that syntactically unrestricted, noncompositional recursive semantics leads to computational explosion (factorial complexity). Hence, with combinatorially unrestricted syntax, semantics with tractable time complexity is compositional.

We study various extensions of Gentzen’s sequent calculus obtained by adding rules for equality. One of them is singled out as particularly natural and shown to satisfy full cut elimination, namely, also atomic cuts can be eliminated. Furthermore we tell apart the extensions that satisfy full cut elimination from those that do not and establish a strengthened form of the nonlenghtening property of Lifschitz and Orevkov.

Anderson and Belnap presented indexed Fitch-style natural deduction systems for the relevant logics R, E, and T. This work was extended by Brady to cover a range of relevant logics. In this paper I present indexed tree natural deduction systems for the Anderson–Belnap–Brady systems and show how to translate proofs in one format into proofs in the other, which establishes the adequacy of the tree systems.

The injective version of Cantor’s theorem appears in full second-order logic as the inconsistency of the abstraction principle, Frege’s Basic Law V (BLV), an inconsistency easily shown using Russell’s paradox. This incompatibility is akin to others—most notably that of a (Dedekind) infinite universe with the Nuisance Principle (NP) discussed by neo-Fregean philosophers of mathematics. This paper uses the Burali–Forti paradox to demonstrate this incompatibility, and another closely related, without appeal to principles related to the axiom of choice—a result hitherto unestablished. It discusses both the general interest of this result, its interest to neo-Fregean philosophy of mathematics, and the potential significance of the Burali–Fortian method of proof.

We study effectively inseparable (abbreviated as e.i.) prelattices (i.e., structures of the form $L = \langle \omega , \wedge , \vee ,0,1,{ \le _L}\rangle$ where ω denotes the set of natural numbers and the following four conditions hold: (1) $\wedge , \vee$ are binary computable operations; (2) ${ \le _L}$ is a computably enumerable preordering relation, with $0{ \le _L}x{ \le _L}1$ for every x; (3) the equivalence relation ${ \equiv _L}$ originated by ${ \le _L}$ is a congruence on L such that the corresponding quotient structure is a nontrivial bounded lattice; (4) the ${ \equiv _L}$ -equivalence classes of 0 and 1 form an effectively inseparable pair of sets). Solving a problem in (Montagna & Sorbi, 1985) we show (Theorem 4.2), that if L is an e.i. prelattice then ${ \le _L}$ is universal with respect to all c.e. preordering relations, i.e., for every c.e. preordering relation R there exists a computable function f reducing R to ${ \le _L}$ , i.e., $xRy$ if and only if $f\left( x \right){ \le _L}f\left( y \right)$ , for all $x,y$ . In fact (Corollary 5.3) ${ \le _L}$ is locally universal, i.e., for every pair $a{ < _L}b$ and every c.e. preordering relation R one can find a reducing function f from R to ${ \le _L}$ such that the range of f is contained in the interval $\left\{ {x:a{ \le _L}x{ \le _L}b} \right\}$ . Also (Theorem 5.7) ${ \le _L}$ is uniformly dense, i.e., there exists a computable function f such that for every $a,b$ if $a{ < _L}b$ then $a{ < _L}f\left( {a,b} \right){ < _L}b$ , and if $a{ \equiv _L}a\prime$ and $b{ \equiv _L}b\prime$ then $f\left( {a,b} \right){ \equiv _L}f\left( {a\prime ,b\prime } \right)$ . Some consequences and applications of these results are discussed: in particular (Corollary 7.2) for $n \ge 1$ the c.e. preordering relation on ${{\rm{\Sigma }}_n}$ sentences yielded by the relation of provable implication of any c.e. consistent extension of Robinson’s system R or Q is locally universal and uniformly dense; and (Corollary 7.3) the c.e. preordering relation yielded by provable implication of any c.e. consistent extension of Heyting Arithmetic is locally universal and uniformly dense.

We present a sequent calculus for the Grzegorczyk modal logic $\mathsf {Grz}$ allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs. As an application, we establish the Lyndon interpolation property for the logic $\mathsf {Grz}$ proof-theoretically.

We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inference is, or consists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentially self-referring. That is, any rule $\rho $ is to be understood via a specification that involves, embedded within it, reference to rule $\rho $ itself. Just how we arrive at this position is explained by reference to familiar rules as well as less familiar ones with unusual features. An inquiry of this kind is surprisingly absent from the foundations of inferentialism—the view that meanings of expressions (especially logical ones) are to be characterized by the rules of inference that govern them.

This paper critically examines two arguments against the generic multiverse, both of which are due to W. Hugh Woodin. Versions of the first argument have appeared a number of times in print, while the second argument is relatively novel. We shall investigate these arguments through the lens of two different attitudes one may take toward the methodology and metaphysics of set theory; and we shall observe that the impact of these arguments depends significantly on which of these attitudes is upheld. Our examination of the second argument involves the development of a new (inner) model for Steel’s multiverse theory, which is delivered in the Appendix.

There has been a recent interest in hierarchical generalizations of classic incompleteness results. This paper provides evidence that such generalizations are readily obtainable from suitably formulated hierarchical versions of the principles used in the original proofs. By collecting such principles, we prove hierarchical versions of Mostowski’s theorem on independent formulae, Kripke’s theorem on flexible formulae, Woodin’s theorem on the universal algorithm, and a few related results. As a corollary, we obtain the expected result that the formula expressing “ $\mathrm {T}$ is $\Sigma _n$ -ill” is a canonical example of a $\Sigma _{n+1}$ formula that is $\Pi _{n+1}$ -conservative over $\mathrm {T}$ .

This paper clarifies, revises, and extends the account of the transmission of truthmakers by core proofs that was set out in chap. 9 of Tennant (2017). Brauer provided two kinds of example making clear the need for this. Unlike Brouwer’s counterexamples to excluded middle, the examples of Brauer that we are dealing with here establish the need for appeals to excluded middle when applying, to the problem of truthmaker-transmission, the already classical metalinguistic theory of model-relative evaluations.

The prevalent interpretation of Gödel’s Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices. In this paper I examine the theorem’s dependency regarding Gödel numberings. I introduce deviant numberings, yielding provability predicates satisfying Löb’s conditions, which result in provable consistency sentences. According to the main result of this paper however, these “counterexamples” do not refute the theorem’s prevalent interpretation, since once a natural class of admissible numberings is singled out, invariance is maintained.

This paper explores the analysis of ability, where ability is to be understood in the epistemic sense—in contrast to what might be called a causal sense. There are plenty of cases where an agent is able to perform an action that guarantees a given result even though she does not know which of her actions guarantees that result. Such an agent possesses the causal ability but lacks the epistemic ability. The standard analysis of such epistemic abilities relies on the notion of action types—as opposed to action tokens—and then posits that an agent has the epistemic ability to do something if and only if there is an action type available to her that she knows guarantees it. We show that these action types are not needed: we present a formalism without action types that can simulate analyzes of epistemic ability that rely on action types. Our formalism is a standard epistemic extension of the theory of “seeing to it that”, which arose from a modal tradition in the logic of action.

Choices rarely deal with certainties; and, where assertoric logic and modal logic are insufficient, those seeking to be reasonable turn to one or more things called “probability.” These things typically have a shared mathematical form, which is an arithmetic construct. The construct is often felt to be unsatisfactory for various reasons. A more general construct is that of a preordering, which may even be incomplete, allowing for cases in which there is no known probability relation between two propositions or between two events. Previous discussion of incomplete preorderings has been as if incidental, with researchers focusing upon preorderings for which quantifications are possible. This article presents formal axioms for the more general case. Challenges peculiar to some specific interpretations of the nature of probability are brought to light in the context of these propositions. A qualitative interpretation is offered for probability differences that are often taken to be quantified. A generalization of Bayesian updating is defended without dependence upon coherence. Qualitative hypothesis testing is offered as a possible alternative in cases for which quantitative hypothesis testing is shown to be unsuitable.

Any set of truth-functional connectives has sequent calculus rules that can be generated systematically from the truth tables of the connectives. Such a sequent calculus gives rise to a multi-conclusion natural deduction system and to a version of Parigot’s free deduction. The elimination rules are “general,” but can be systematically simplified. Cut-elimination and normalization hold. Restriction to a single formula in the succedent yields intuitionistic versions of these systems. The rules also yield generalized lambda calculi providing proof terms for natural deduction proofs as in the Curry–Howard isomorphism. Addition of an indirect proof rule yields classical single-conclusion versions of these systems. Gentzen’s standard systems arise as special cases.

The aim of the paper is to argue that all—or almost all—logical rules have exceptions. In particular, it is argued that this is a moral that we should draw from the semantic paradoxes. The idea that we should respond to the paradoxes by revising logic in some way is familiar. But previous proposals advocate the replacement of classical logic with some alternative logic. That is, some alternative system of rules, where it is taken for granted that these hold without exception. The present proposal is quite different. According to this, there is no such alternative logic. Rather, classical logic retains the status of the ‘one true logic’, but this status must be reconceived so as to be compatible with (almost) all of its rules admitting of exceptions. This would seem to have significant repercussions for a range of widely held views about logic: e.g., that it is a priori, or that it is necessary. Indeed, if the arguments of the paper succeed, then such views must be given up.

We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as Lellman’s linear nested sequents, but were developed independently by Restall for S5 and extended to other normal modal logics by Parisi. The resulting systems obey Došen’s principle: the modal rules are the same across different modal logics. Different modal systems only differ in the presence or absence of external structural rules. With the exception of S5, the systems are modular in the sense that different structural rules capture different properties of the accessibility relation. We provide the first direct semantical cut-free completeness proofs for K, T, and D, and show how this method fails in the case of B and S4.

Is knowledge definable as justified true belief (“JTB”)? We argue that one can legitimately answer positively or negatively, depending on whether or not one’s true belief is justified by what we call adequate reasons. To facilitate our argument we introduce a simple propositional logic of reason-based belief, and give an axiomatic characterization of the notion of adequacy for reasons. We show that this logic is sufficiently flexible to accommodate various useful features, including quantification over reasons. We use our framework to contrast two notions of JTB: one internalist, the other externalist. We argue that Gettier cases essentially challenge the internalist notion but not the externalist one. Our approach commits us to a form of infallibilism about knowledge, but it also leaves us with a puzzle, namely whether knowledge involves the possession of only adequate reasons, or leaves room for some inadequate reasons. We favor the latter position, which reflects a milder and more realistic version of infallibilism.

A central area of current philosophical debate in the foundations of mathematics concerns whether or not there is a single, maximal, universe of set theory. Universists maintain that there is such a universe, while Multiversists argue that there are many universes, no one of which is ontologically privileged. Often model-theoretic constructions that add sets to models are cited as evidence in favor of the latter. This paper informs this debate by developing a way for a Universist to interpret talk that seems to necessitate the addition of sets to V. We argue that, despite the prima facie incoherence of such talk for the Universist, she nonetheless has reason to try and provide interpretation of this discourse. We present a method of interpreting extension-talk (V-logic), and show how it captures satisfaction in ‘ideal’ outer models and relates to impredicative class theories. We provide some reasons to regard the technique as philosophically virtuous, and argue that it opens new doors to philosophical and mathematical discussions for the Universist.

After the publication of Begriffsschrift, a conflict erupted between Frege and Schröder regarding their respective logical systems which emerged around the Leibnizian notions of lingua characterica and calculus ratiocinator. Both of them claimed their own logic to be a better realisation of Leibniz’s ideal language and considered the rival system a mere calculus ratiocinator. Inspired by this polemic, van Heijenoort (1967b) distinguished two conceptions of logic—logic as language and logic as calculus—and presented them as opposing views, but did not explain Frege’s and Schröder’s conceptions of the fulfilment of Leibniz’s scientific ideal.

In this paper I explain the reasons for Frege’s and Schröder’s mutual accusations of having created a mere calculus ratiocinator. On the one hand, Schröder’s construction of the algebra of relatives fits with a project for the reduction of any mathematical concept to the notion of relative. From this stance I argue that he deemed the formal system of Begriffsschrift incapable of such a reduction. On the other hand, first I argue that Frege took Boolean logic to be an abstract logical theory inadequate for the rendering of specific content; then I claim that the language of Begriffsschrift did not constitute a complete lingua characterica by itself, more being seen by Frege as a tool that could be applied to scientific disciplines. Accordingly, I argue that Frege’s project of constructing a lingua characterica was not tied to his later logicist programme.