We introduce Arbitrary Public Announcement Logic with Memory (APALM), obtained by adding to the models a ‘memory’ of the initial states, representing the information before any communication took place (“the prior”), and adding to the syntax operators that can access this memory. We show that APALM is recursively axiomatizable (in contrast to the original Arbitrary Public Announcement Logic, for which

Conditionals with conditional constituents pose challenges for the Thesis, the idea that the probability of a conditional is the corresponding conditional probability. This note is concerned with two proposals for overcoming those challenges, both inspired by early work of van Fraassen: the Bernoulli Semantics associated with Stalnaker and Jeffrey, and augmented with a mechanism for obtaining “local

In this paper, we investigate neighbourhood semantics for modal extensions of relevant logics. In particular, we combine the neighbourhood interpretation of the relevant implication (and related connectives) with a neighbourhood interpretation of modal operators. We prove completeness for a range of systems and investigate the relations between neighbourhood models and relational models, setting out

Belief revision theories standardly endorse a principle of intensionality to the effect that ideal doxastic agents do not discriminate between pieces of information that are equivalent within classical logic. I argue that this principle should be rejected. Its failure, on my view, does not require failures of logical omniscience on the part of the agent, but results from a view of the update as mighty:

Frame semantics for negation on the Australian Plan accommodates many different negations, but it falls short on accommodating subminimal negation when the language contains conjunction and disjunction. In this paper, I will present a multi-relational frame semantics –multi-incompatibility frame semantics– that can accommodate subminimal negation. I will first argue that multi-incompatibility frames

In this paper we study the interaction between symmetric logic and probability. In particular, we axiomatize the convex hull of the set of evaluations of symmetric logic, yielding the notion of probability in symmetric logic. This answers an open problem of Williams (2016) and Paris (2001).

This paper introduces the logic QLETF, a quantified extension of the logic of evidence and truth LETF, together with a corresponding sound and complete first-order non-deterministic valuation semantics. LETF is a paraconsistent and paracomplete sentential logic that extends the logic of first-degree entailment (FDE) with a classicality operator ∘ and a non-classicality operator ∙, dual to each other:

Truth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature of this function. We offer a series of formal results in support of the thesis that disquotational truth is a device to simulate higher-order resources in a first-order setting. More specifically, we show that any theory formulated in a higher-order

I give a semantics for a logic with two pairs of doxastic modals and an indicative conditional connective that all nest without restriction. Sentences are evaluated as accepted, rejected, or neither. Certainty is the necessity-like modality of acceptance. Inferences may proceed from premises that are certain, or merely accepted, or a mix of both. This semantic setup yields some striking results. Notably

In ‘Sly Pete’ or ‘standoff’ cases, reasonable speakers accept incompatible conditionals, and communicate them successfully to a trusting hearer. This paper uses the framework of dynamic semantics to offer a new model of the conversational dynamics at play in standoffs, and to articulate several puzzles posed by such cases. The paper resolves these puzzles by embracing a dynamic semantics for conditionals

A Correction to this paper has been published: https://doi.org/10.1007/s10992-022-09665-5

This paper calls for a re-appraisal of McGee’s analysis of the semantics, logic and probabilities of indicative conditionals presented in his 1989 paper Conditional probabilities and compounds of conditionals. The probabilistic measures introduced by McGee are given a new axiomatisation—built on the principle that the antecedent of a conditional is probabilistically independent of the conditional—and

Proof-theoretic semantics is an inferentialist theory of meaning, usually developed in a multiple-assumption and single-conclusion framework. In that framework, this theory seems unable to justify classical logic, so some authors have proposed a multiple-conclusion reformulation to accomplish this goal. In the first part of this paper, the debate originated by this proposal is briefly exposed and used

First-order intuitionistic and classical Nelson–Wansing and Arieli–Avron–Zamansky logics, which are regarded as paradefinite and connexive logics, are investigated based on Gentzen-style sequent calculi. The cut-elimination and completeness theorems for these logics are proved uniformly via theorems for embedding these logics into first-order intuitionistic and classical logics. The modified Craig

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics

This paper is a step toward showing what is achievable using non-classical metatheory—particularly, a substructural paraconsistent framework. What standard results, or analogues thereof, from the classical metatheory of first order logic(s) can be obtained? We reconstruct some of the originals proofs for Completeness, Löwenheim-Skolem and Compactness theorems in the context of a substructural logic

I propose a theory of space with infinitesimal regions called smooth infinitesimal geometry (SIG) based on certain algebraic objects (i.e., rings), which regiments a mode of reasoning heuristically used by geometricists and physicists (e.g., circle is composed of infinitely many straight lines). I argue that SIG has the following utilities. (1) It provides a simple metaphysics of vector fields and

What is the relation between metaphysical necessity and essence? This paper defends the view that the relation is one of identity: metaphysical necessity is a special case of essence. My argument consists in showing that the best joint theory of essence and metaphysical necessity is one in which metaphysical necessity is just a special case of essence. The argument is made against the backdrop of a

I show that it is not possible to uniquely characterize classical logic when working within classical set theory. By building on recent work by Eduardo Barrio, Federico Pailos, and Damian Szmuc, I show that for every inferential level (finite and transfinite), either classical logic is not unique at that level or there exist intuitively valid inferences of that level that are not definable in modern

Formal symptoms of relevance usually concern the propositional variables shared between the antecedent and the consequent of provable conditionals. Among the most famous results about such symptoms are Belnap’s early results showing that for sublogics of the strong relevant logic R, provable conditionals share a signed variable between antecedent and consequent. For logics weaker than R stronger variable

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct

As shown in Fan (Journal of Philosophical Logic, 48, 425–445, 2019), there are some similarities/resemblances between contingency and accident. Given this, one may naturally ask if we can unify the two operators to manifest all of their similarities/resemblances. In this article, instead of looking at the interactions between the two operators like in Fan (Journal of Philosophical Logic, 48, 425–445

Thagard (1992) presented a framework for conceptual change in science based on conceptual systems. Thagard challenged belief revision theorists, claiming that traditional belief-revision systems are able to model only the two most conservative types of changes in his framework, but not the more radical ones. The main aim of this work is to take up Thagard’s challenge, presenting a belief-revision-like

This paper outlines an account of concessive conditionals that rests on two main ideas. One is that the logical form of a sentence as used in a given context is determined by the content expressed by the sentence in that context. The other is that a coherent distinction can be drawn between a reading of ‘if’ according to which a conditional is true when its consequent holds on the supposition that

It would be a good thing to have at our disposal a general theory of location that is neutral with respect to (i.e. that does not rule out or entail) (i) the view that some objects have more than one exact location, (ii) the view that some objects are located without having an exact location, and (iii) the view that some objects are “spanners”—where a spanner is an object exactly located at a region

In this paper, we argue for an instrumental form of existence, inspired by Hilbert’s method of ideal elements. As a case study, we consider the existence of contradictory objects in models of non-classical set theories. Based on this discussion, we argue for a very liberal notion of existence in mathematics.

We study classical modal logics with pooling modalities, i.e. unary modal operators that allow one to express properties of sets obtained by the pointwise intersection of neighbourhoods. We discuss salient properties of these modalities, situate the logics in the broader area of modal logics (with a particular focus on relational semantics), establish key properties concerning their expressive power

The “official” history of connexive logic was written in 2012 by Storrs McCall who argued that connexive logic was founded by ancient logicians like Aristotle, Chrysippus, and Boethius; that it was further developed by medieval logicians like Abelard, Kilwardby, and Paul of Venice; and that it was rediscovered in the 19th and twentieth century by Lewis Carroll, Hugh MacColl, Frank P. Ramsey, and Everett

This paper proves a precisification of Hume’s Law—the thesis that one cannot get an ought from an is—as an instance of a more general theorem which establishes several other philosophically interesting, though less controversial, barriers to logical consequence.

This essay introduces a novel framework to studying many-valued logics – the movable truth value (or MTV) approach. After setting up the framework, we will show that a vast number of many-valued logics, and in particular many-valued logics that have previously been given very different kinds of semantics, including C, K3, LP, ST, TS, RMfde, and FDE, can all be unified within the MTV-logic approach

Building on early work by Girard (1987) and using closely related techniques from the proof theory of many-valued logics, we propose a sequent calculus capturing a hierarchy of notions of satisfaction based on the Strong Kleene matrices introduced by Barrio et al. (Journal of Philosophical Logic 49:93–120, 2020) and others. The calculus allows one to establish and generalize in a very natural manner

Many analyses of notion of metainferences in the non-transitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the strict-tolerant hierarchy based on the three-valued function for the LP material conditional

We present a revenge argument for non-reflexive theories of semantic notions – theories which restrict the rule of assumption, or (equivalently) initial sequents of the form φ ⊩ φ. Our strategy follows the general template articulated in Murzi and Rossi [21]: we proceed via the definition of a notion of paradoxicality for non-reflexive theories which in turn breeds paradoxes that standard non-reflexive

This paper develops a theory of propositional identity which distinguishes necessarily equivalent propositions that differ in subject-matter. Rather than forming a Boolean lattice as in extensional and intensional semantic theories, the space of propositions forms a non-interlaced bilattice. After motivating a departure from tradition by way of a number of plausible principles for subject-matter, I

Arguments have always played a central role within logic and philosophy. But little attention has been paid to arguments as a distinctive kind of discourse, with its own semantics and pragmatics. The goal of this essay is to study the mechanisms by means of which we make arguments in discourse, starting from the semantics of argument connectives such as ‘therefore’. While some proposals have been made

The Mares-Goldblatt semantics for quantified relevant logics have been developed for first-order extensions of R, and a range of other relevant logics and modal extensions thereof. All such work has taken place in the the ternary relation semantic framework, most famously developed by Sylvan (née Routley) and Meyer. In this paper, the Mares-Goldblatt technique for the interpretation of quantifiers

In this paper, we investigate the semantics and logic of choice-driven counterfactuals, that is, of counterfactuals whose evaluation relies on auxiliary premises about how agents are expected to act, i.e., about their default choice behavior. To do this, we merge one of the most prominent logics of agency in the philosophical literature, namely stit logic (Belnap et al. 2001; Horty 2001), with the

In order to reply to the contemporary skeptic’s argument for the conclusion that we don’t have any empirical knowledge about the external world, several authors have proposed different fallibilist theories of knowledge that reject the epistemic closure principle. Holliday (Journal of Philosophical Logic, 44(1), 1–62 2015a), however, shows that almost all of them suffer from either the problem of containment

Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value (sec. 1). Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is

To investigate the relationship between logical reasoning and majority voting, we introduce logic with groups Lg in the style of Gentzen’s sequent calculus, where every sequent is indexed by a group of individuals. We also introduce the set-theoretical semantics of Lg, where every formula is interpreted as a certain closed set of groups whose members accept that formula. We present the cut-elimination

A Correction to this paper has been published: https://doi.org/10.1007/s10992-021-09632-6

We develop a theory of necessity operators within a version of higher-order logic that is neutral about how fine-grained reality is. The theory is axiomatized in terms of the primitive of being a necessity, and we show how the central notions in the philosophy of modality can be recovered from it. Various questions are formulated and settled within the framework, including questions about the ordering

In this paper we treat metasequents—objects which stand to sequents as sequents stand to formulas—as first class logical citizens. To this end we provide a metasequent calculus, a sequent calculus which allows us to directly manipulate metasequents. We show that the various metasequent calculi we consider are sound and complete w.r.t. appropriate classes of tetravaluations where validity is understood

This paper explores the idea that Descartes’ cogito is a kind of diagonal argument. Using tools from modal logic, it reviews some historical antecedents of this idea from Slezak and Boos and culminates in an orginal result classifying the exact structure of belief frames capable of supporting diagonal arguments and our reconstruction of the cogito.

Hodes (2021) “looked under the hood” of the familiar versions of the classical propositional modal logic K and its intuitionistic counterpart (see Plotkin & Sterling 1986). This paper continues that project, addressing some familiar classical strengthenings of K (D, T, K4, KB, K5, Dio (the Diodorian strengthening of K) and GL), and their intuitionistic counterparts (see Plotkin & Sterling 1986 for

Prawitz has recently developed a theory of epistemic grounding that differs in many respects from his earlier semantics of arguments and proofs. An innovative approach to (valid) inferences yields a new conception of the intertwinement of the notions of valid inference and proof. We aim at singling out three reasons that may have led Prawitz to the ground-theoretic turn, i.e.: a better order in the

Barrio et al. (Journal of Philosophical Logic, 49(1), 93–120, 2020) and Pailos (Review of Symbolic Logic, 2020(2), 249–268, 2020) develop an approach to define various metainferential hierarchies on strong Kleene models by transferring the idea of distinct standards for premises and conclusions from inferences to metainferences. In particular, they focus on a hierarchy named the \(\mathbb {S}\mathbb

Many classically valid meta-inferences fail in a standard supervaluationist framework. This allegedly prevents supervaluationism from offering an account of good deductive reasoning. We provide a proof system for supervaluationist logic which includes supervaluationistically acceptable versions of the classical meta-inferences. The proof system emerges naturally by thinking of truth as licensing assertion

In a recent paper, Barrio, Pailos and Szmuc (BPS) show that there are logics that have exactly the validities of classical logic up to arbitrarily high levels of inference. They suggest that a logic therefore must be identified by its valid inferences at every inferential level. However, Scambler shows that there are logics with all the validities of classical logic at every inferential level, but

The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than

TS is a logic that has no valid inferences. But, could there be a logic without valid metainferences? We will introduce TSω, a logic without metainferential validities. Notwithstanding, TSω is not as empty—i.e., uninformative—as it gets, because it has many antivalidities. We will later introduce the two-standard logic [TSω, STω], a logic without validities and antivalidities. Nevertheless, [TSω, STω]

I explore, from a proof-theoretic perspective, the hierarchy of classical and paraconsistent logics introduced by Barrio, Pailos and Szmuc in (Journal o f Philosophical Logic, 49, 93-120, 2021). First, I provide sequent rules and axioms for all the logics in the hierarchy, for all inferential levels, and establish soundness and completeness results. Second, I show how to extend those systems with a

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics ST and TS. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of

The notion of grounding is usually conceived as an objective and explanatory relation. It connects two relata if one—the ground—determines or explains the other—the consequence. In the contemporary literature on grounding, much effort has been devoted to logically characterize the formal aspects of grounding, but a major hard problem remains: defining suitable grounding principles for universal and

In this study, falsification-aware semantics and sequent calculi for first-order classical logic are introduced and investigated. These semantics and sequent calculi are constructed based on a falsification-aware setting for first-order Nelson constructive three-valued logic (N3). In fact, these semantics and sequent calculi are regarded as those for a classical variant of N3 (i.e., a classical variant

Orthodoxy holds that there is a determinate fact of the matter about every arithmetical claim. Little argument has been supplied in favour of orthodoxy, and work of Field, Warren and Waxman, and others suggests that the presumption in its favour is unjustified. This paper supports orthodoxy by establishing the determinacy of arithmetic in a well-motivated modal plural logic (Theorem 1). Recasting this

It is widely accepted that classical logic is trivialized in the presence of a transparent truth-predicate. In this paper, we will explain why this point of view must be given up. The hierarchy of metainferential logics defined in Barrio et al. (Journal of Philosophical Logic, 1–28, 2019) and Pailos (The Review of Symbolic Logic, Forthcoming) recovers classical logic, either in the sense that every