We identify a class of paradoxes that is neither set-theoretical nor semantical, but that seems to depend on intensionality. In particular, these paradoxes arise out of plausible properties of propositional attitudes and their objects. We try to explain why logicians have neglected these paradoxes, and to show that, like the Russell Paradox and the direct discourse Liar Paradox, these intensional paradoxes are recalcitrant and challenge logical analysis. Indeed, when we take these paradoxes seriously, we may need to rethink the commonly accepted methods for dealing with the logical paradoxes.

We offer an interpretation of the words and works of Richard Dedekind and the David Hilbert of around 1900 on which they are held to entertain diverging views on the structure of a deductive science. Firstly, it is argued that Dedekind sees the beginnings of a science in concepts, whereas Hilbert sees such beginnings in axioms. Secondly, it is argued that for Dedekind, the primitive terms of a science are substantive terms whose sense is to be conveyed by elucidation, whereas Hilbert dismisses elucidation and consequently treats the primitives as schematic.

Although Kant (1998) envisaged a prominent role for logic in the argumentative structure of his Critique of Pure Reason, logicians and philosophers have generally judged Kant’s logic negatively. What Kant called ‘general’ or ‘formal’ logic has been dismissed as a fairly arbitrary subsystem of first-order logic, and what he called ‘transcendental logic’ is considered to be not a logic at all: no syntax, no semantics, no definition of validity. Against this, we argue that Kant’s ‘transcendental logic’ is a logic in the strict formal sense, albeit with a semantics and a definition of validity that are vastly more complex than that of first-order logic. The main technical application of the formalism developed here is a formal proof that Kant’s Table of Judgements in Section 9 of the Critique of Pure Reason, is indeed, as Kant claimed, complete for the kind of semantics he had in mind. This result implies that Kant’s ‘general’ logic is after all a distinguished subsystem of first-order logic, namely what is known as geometric logic.

We show that a paraconsistent set theory proposed in Weber (2010) is strong enough to provide a quite classical nonprimitive notion of identity, so that the relation is an equivalence relation and also obeys full substitutivity: a = b → (F(a) → F(b)). With this as background it is shown that the proposed theory also proves ∀x(x ≠ x). While not by itself showing that the proposed system is trivial in the sense of proving all statements, it is argued that this outcome makes the system inadequate.

We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ (↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain.

This work focuses in the case where the memory is a set, and we can test whether the current node belongs to the set or not. We prove that, in terms of expressive power, the memory logics we discuss here lie between the basic modal logic and ℋℒ (↓). We show that the satisfiability problem of most of the logics we cover is undecidable. The only logic with a decidable satisfiability problem is obtained by imposing strong constraints on which elements can be memorized.

We introduce and study a PDL-style logic for reasoning about protocols, or plans, under imperfect information. Our paper touches on a number of issues surrounding the relationship between an agent’s abilities, available choices, and information in an interactive situation. The main question we address is under what circumstances can the agent commit to a protocol or plan, and what can she achieve by doing so?

In spite of its significance for everyday and philosophical discourse, the explanatory connective ‘because’ has not received much treatment in the philosophy of logic. The present paper develops a logic for ‘because’ based on systematic connections between ‘because’ and the truth-functional connectives.

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base.

In this note we derive Robinson’s Arithmetic from Hume’s Principle in the context of very weak theories of classes and relations.

Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There’s little consensus, however, about how to fill out the bare-bones idea to include a characterization of logical consequence. The paper explores one methodology for choosing between the logics: pick a logic that norms belief as classical consequence is standardly thought to do. The main focus of the paper considers a variant of standard supervaluational, on which we can characterize degrees of determinacy. It applies the methodology above to focus on degree logic. This is developed first in a basic, single-premise case; and then extended to the multipremise case, and to allow degrees of consequence. The metatheoretic properties of degree logic are set out. On the positive side, the logic is supraclassical—all classical valid sequents are degree logic valid. Strikingly, metarules such as cut and conjunction introduction fail.

Philosophical applications of familiar paracomplete and paraconsistent logics often rely on an idea of ‘default classicality’. With respect to the paraconsistent logic LP (the dual of Strong Kleene or K3), such ‘default classicality’ is standardly cashed out via an LP-based nonmonotonic logic due to Priest (1991, 2006a). In this paper, I offer an alternative approach via a monotonic multiple-conclusion version of LP.

The paper proposes a semantic value for the logical constants (connectives and quantifiers) within the framework of proof-theoretic semantics, basic meaning on the introduction rules of a meaning conferring natural deduction proof system. The semantic value is defined based on Frege’s Context Principle, by taking “contributions” to sentential meanings as determined by the function-argument structure as induced by a type-logical grammar. In doing so, the paper proposes a novel proof-theoretic interpretation of the semantic types, traditionally interpreted in Henkin models. The compositionality of the resulting attribution of semantic values is discussed. Elsewhere, the same method was used for defining proof-theoretic meaning of subsentential phrases in a fragment of natural language. Doing the same for (the simpler and clearer case of) logic sheds more light on the proposal.

A new (sound and complete) proof style adequate for modal logics is defined from the polynomial ring calculus (PRC). The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra–Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S5, and can be easily extended to other modal logics.

Counterexamples to reassurance relative to a “less inconsistent” relation between models of the logic of paradox are provided. Another relation, designed to fix the problem in logic without equality, is introduced and discussed in connection with the issue of classical recapture.