In this paper, I motivate a cut free sequent calculus for classical logic with first order quantification, allowing for singular terms free of existential import. Along the way, I motivate a criterion for rules designed to answer Prior’s question about what distinguishes rules for logical concepts, like conjunction from apparently similar rules for putative concepts like Prior’s tonk, and I show that the rules for the quantifiers—and the existence predicate—satisfy that condition.

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language, as in (Kripke, 1975). In this article, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences—liar-like sentences, truth-teller–like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this article yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model.

In the topological semantics, quantified intuitionistic logic, QH, is known to be strongly complete not only for the class of all topological spaces but also for some particular topological spaces — for example, for the irrational line, ${\Bbb P}$, and for the rational line, ${\Bbb Q}$, in each case with a constant countable domain for the quantifiers. Each of ${\Bbb P}$ and ${\Bbb Q}$ is a separable zero-dimensional dense-in-itself metrizable space. The main result of the current article generalizes these known results: QH is strongly complete for any zero-dimensional dense-in-itself metrizable space with a constant domain of cardinality ≤ the space’s weight; consequently, QH is strongly complete for any separable zero-dimensional dense-in-itself metrizable space with a constant countable domain. We also prove a result that follows from earlier work of Moerdijk: if we allow varying domains for the quantifiers, then QH is strongly complete for any dense-in-itself metrizable space with countable domains.

This article investigates the proof theory of the Quantified Argument Calculus (Quarc) as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction (Suppes-Lemmon style), we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta-theoretic results with minor modifications to the Gentzen’s original framework, i.e., LK. As will be made clear in course of the article LK-Quarc will enjoy cut elimination and its corollaries (including subformula property and thus consistency).

The Univalence axiom, due to Vladimir Voevodsky, is often taken to be one of the most important discoveries arising from the Homotopy Type Theory (HoTT) research programme. It is said by Steve Awodey that Univalence embodies mathematical structuralism, and that Univalence may be regarded as ‘expanding the notion of identity to that of equivalence’. This article explores the conceptual, foundational and philosophical status of Univalence in Homotopy Type Theory. It extends our Types-as-Concepts interpretation of HoTT to Universes, and offers an account of the Univalence axiom in such terms. We consider Awodey’s informal argument that Univalence is motivated by the principle that reasoning should be invariant under isomorphism, and we examine whether an autonomous and rigorous justification along these lines can be given. We consider two problems facing such a justification. First, there is a difference between equivalence and isomorphism and Univalence must be formulated in terms of the former. Second, the argument as presented cannot establish Univalence itself but only a weaker version of it, and must be supplemented by an additional principle. The article argues that the prospects for an autonomous justification of Univalence are promising.

Sorites is an ancient piece of paradoxical reasoning pertaining to sets with the following properties: (Supervenience) elements of the set are mapped into some set of “attributes”; (Tolerance) if an element has a given attribute then so are the elements in some vicinity of this element; and (Connectedness) such vicinities can be arranged into pairwise overlapping finite chains connecting two elements with different attributes. Obviously, if Superveneince is assumed, then (1) Tolerance implies lack of Connectedness, and (2) Connectedness implies lack of Tolerance. Using a very general but precise definition of “vicinity”, Dzhafarov & Dzhafarov (2010) offered two formalizations of these mutual contrapositions. Mathematically, the formalizations are equally valid, but in this paper, we offer a different basis by which to compare them. Namely, we show that the formalizations have different proof-theoretic strengths when measured in the framework of reverse mathematics: the formalization of (1) is provable in $RC{A_0}$, while the formalization of (2) is equivalent to $AC{A_0}$ over $RC{A_0}$. Thus, in a certain precise sense, the approach of (1) is more constructive than that of (2).

Modal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the first-order modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging over the set of agents, and proves its soundness and completeness with respect to a Kripke semantics.

This article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, we show that this is impossible to do in the first-order case. However, one can still construct a canonical model where every possibility consists of a computable set of formulas and thus still of finitely much information.

We introduce unification in first-order logic. In propositional logic, unification was introduced by S. Ghilardi, see Ghilardi (1997, 1999, 2000). He successfully applied it in solving systematically the problem of admissibility of inference rules in intuitionistic and transitive modal propositional logics. Here we focus on superintuitionistic predicate logics and apply unification to some old and new problems: definability of disjunction and existential quantifier, disjunction and existential quantifier under implication, admissible rules, a basis for the passive rules, (almost) structural completeness, etc. For this aim we apply modified specific notions, introduced in propositional logic by Ghilardi, such as projective formulas, projective unifiers, etc.

Unification in predicate logic seems to be harder than in the propositional case. Any definition of the key concept of substitution for predicate variables must take care of individual variables. We allow adding new free individual variables by substitutions (contrary to Pogorzelski & Prucnal (1975)). Moreover, since predicate logic is not as close to algebra as propositional logic, direct application of useful algebraic notions of finitely presented algebras, projective algebras, etc., is not possible.

Graded epistemic logic is a logic for reasoning about uncertainties. Graded epistemic logic is interpreted on graded models. These models are generalizations of Kripke models. We obtain completeness of some graded epistemic logics. We further develop dynamic extensions of graded epistemic logics, along the framework of dynamic epistemic logic. We give an extension with public announcements, i.e., public events, and an extension with graded event models, a generalization also including nonpublic events. We present complete axiomatizations for both logics.

We analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engström, comparing them with a more general, higher order definition of team quantifier. We show that Engström’s definitions (and other quantifiers from the literature) can be identified, by means of appropriate lifts, with special classes of team quantifiers. We point out that the new team quantifiers express a quantitative and a qualitative component, while Engström’s quantifiers only range over the latter. We further argue that Engström’s definitions are just embeddings of the first-order generalized quantifiers into team semantics, and fail to capture an adequate notion of team-theoretical generalized quantifier, save for the special cases in which the quantifiers are applied to flat formulas. We also raise several doubts concerning the meaningfulness of the monotone/nonmonotone distinction in this context. In the appendix we develop some proof theory for Engström’s quantifiers.

First-order formalisations are often preferred to propositional ones because they are thought to underwrite the validity of more arguments. We compare and contrast the ability of some well-known logics—these two in particular—to formally capture valid and invalid arguments. We show that there is a precise and important sense in which first-order logic does not improve on propositional logic in this respect. We also prove some generalisations and related results of philosophical interest. The rest of the article investigates the results’ philosophical significance. A first moral is that the correct way to state the oft-cited superiority of first-order logic vis-à-vis propositional logic is more nuanced than often thought. The second moral concerns semantic theory; the third logic’s use as a tool for discovery. A fourth and final moral is that second-order logic’s transcendence of first-order logic is greater than first-order logic’s transcendence of propositional logic.

Recently, several epistemologists have defended an attractive principle of epistemic rationality, which we shall call Ur-Prior Conditionalization. In this essay, I ask whether we can justify this principle by appealing to the epistemic goal of accuracy. I argue that any such accuracy-based argument will be in tension with Evidence Externalism, i.e., the view that agent’s evidence may entail nontrivial propositions about the external world. This is because any such argument will crucially require the assumption that, independently of all empirical evidence, it is rational for an agent to be certain that her evidence will always include truths, and that she will always have perfect introspective access to her own evidence. This assumption is incompatible with Evidence Externalism. I go on to suggest that even if we don’t accept Evidence Externalism, the prospects for any accuracy-based justification for Ur-Prior Conditionalization are bleak.

This paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic. We introduce a relational semantic framework for substructural logics that enables us to define the notion of an inquisitive extension of λ, denoted as ${\lambda ^?}$, for any logic λ that is at least as strong as BSL. A general theory of these “inquisitive extensions” is worked out. In particular, it is shown how to axiomatize ${\lambda ^?}$, given the axiomatization of λ. Furthermore, the general theory is applied to some prominent logical systems in the class: classical logic Cl, intuitionistic logic Int, and t-norm based fuzzy logics, including for example Łukasiewicz fuzzy logic Ł. For the inquisitive extensions of these logics, axiomatization is provided and a suitable semantics found.

Standard reasoning about Kripke semantics for modal logic is almost always based on a background framework of classical logic. Can proofs for familiar definability theorems be carried out using a nonclassical substructural logic as the metatheory? This article presents a semantics for positive substructural modal logic and studies the connection between frame conditions and formulas, via definability theorems. The novelty is that all the proofs are carried out with a noncontractive logic in the background. This sheds light on which modal principles are invariant under changes of metalogic, and provides (further) evidence for the general viability of nonclassical mathematics.

In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem (1979), “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to ${\cal V}$-baos, namely the provability logic $GLB$ (Japaridze, 1988; Boolos, 1993). We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is ${\cal V}$-complete. After these results, we generalize the Blok Dichotomy (Blok, 1978) to degrees of ${\cal V}$-incompleteness. In the end, we return to van Benthem’s theme of syntactic aspects of modal incompleteness.

Recent discussions on Fregean and neo-Fregean foundations for arithmetic and real analysis pay much attention to what is called either ‘Application Constraint’ ($AC$) or ‘Frege Constraint’ ($FC$), the requirement that a mathematical theory be so outlined that it immediately allows explaining for its applicability. We distinguish between two constraints, which we, respectively, denote by the latter of these two names, by showing how $AC$ generalizes Frege’s views while $FC$ comes closer to his original conceptions. Different authors diverge on the interpretation of $FC$ and on whether it applies to definitions of both natural and real numbers. Our aim is to trace the origins of $FC$ and to explore how different understandings of it can be faithful to Frege’s views about such definitions and to his foundational program. After rehearsing the essential elements of the relevant debate (§1), we appropriately distinguish $AC$ from $FC$ (§2). We discuss six rationales which may motivate the adoption of different instances of $AC$ and $FC$ (§3). We turn to the possible interpretations of $FC$ (§4), and advance a Semantic $FC$ (§4.1), arguing that while it suits Frege’s definition of natural numbers (4.1.1), it cannot reasonably be imposed on definitions of real numbers (§4.1.2), for reasons only partly similar to those offered by Crispin Wright (§4.1.3). We then rehearse a recent exchange between Bob Hale and Vadim Batitzky to shed light on Frege’s conception of real numbers and magnitudes (§4.2). We argue that an Architectonic version of $FC$ is indeed faithful to Frege’s definition of real numbers, and compatible with his views on natural ones. Finally, we consider how attributing different instances of $FC$ to Frege and appreciating the role of the Architectonic $FC$ can provide a more perspicuous understanding of his foundational program, by questioning common pictures of his logicism (§5).

We develop a series of small infinitary epistemic logics to study deductive inference involving intra-/interpersonal beliefs/knowledge such as common knowledge, common beliefs, and infinite regress of beliefs. Specifically, propositional epistemic logics GL (Lα) are presented for ordinal α up to a given αo (αo ≥ ω) so that GL(L0) is finitary KDn with n agents and GL(Lα) (α ≥ 1) allows conjunctions of certain countably infinite formulae. GL(Lα) is small in that the language is countable and can be constructive. The set of formulae Lα is increasing up to α = ω but stops at ω We present Kripke-completeness for GL(Lα) for each α ≤ ω, which is proved using the Rasiowa–Sikorski lemma and Tanaka–Ono lemma. GL(Lα) has a sufficient expressive power to discuss intra-/interpersonal beliefs with infinite lengths. As applications, we discuss the explicit definability of Axioms T (truthfulness), 4 (positive introspection), 5 (negative introspection), and of common knowledge in GL(Lα) Also, we discuss the rationalizability concept in game theory in our framework. We evaluate where these discussions are done in the series GL(Lα), α ≤ ω.

An exact truthmaker for A is a state which, as well as guaranteeing A’s truth, is wholly relevant to it. States with parts irrelevant to whether A is true do not count as exact truthmakers for A. Giving semantics in this way produces a very unusual consequence relation, on which conjunctions do not entail their conjuncts. This feature makes the resulting logic highly unusual. In this paper, we set out formal semantics for exact truthmaking and characterise the resulting notion of entailment, showing that it is compact and decidable. We then investigate the effect of various restrictions on the semantics. We also formulate a sequent-style proof system for exact entailment and give soundness and completeness results.

We generalise the Blok–Jónsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and Jónsson admit, in place of sheer formulas, a wider range of syntactic units to be manipulated in deductions (including sequents or equations), these objects are invariably aggregated via set-theoretical union. Our approach is more general in that nonidempotent forms of premiss and conclusion aggregation, including multiset sum and fuzzy set union, are considered. In their abstract form, thus, deductive relations are defined as additional compatible preorderings over certain partially ordered monoids. We investigate these relations using categorical methods and provide analogues of the main results obtained in the general theory of consequence relations. Then we focus on the driving example of multiset deductive relations, providing variations of the methods of matrix semantics and Hilbert systems in Abstract Algebraic Logic.