Thomas Ferguson

In several recent papers, an interpretation of G.F.C. Griss’s ‘negationless’ mathematics has been given in which techniques in the style of David Nelson are used. Two refinements of this ‘executability interpretation’ have been considered: the prehensivist refinement (in which the mathematician can conceive of any statement as though true) and the nonprehensivist refinement. In this paper, we emphasize arithmetic in a prehensivist refinement. We note a connection between this type of interpretation and possibilism and use this connection to show some results concerning arithmetic, namely that mathematical induction presupposes possibilism in the sense of Luis Estrada-González and that Peano arithmetic in this system is Post consistent, i.e. has nontrivial models.

For relevant logics, the admissibility of the rule of proof $\gamma $ has played a significant historical role in the development of relevant logics. For first-order logics, however, there have been only a handful of $\gamma $ -admissibility proofs for a select few logics. Here we show that, for each logic L of a wide range of propositional relevant logics for which excluded middle is valid (with fusion and the Ackermann truth constant), the first-order extensions QL and LQ admit $\gamma $. Specifically, these are particular “conventionally normal” extensions of the logic $\mathbf {G}^{g,d}$, which is the least propositional relevant logic (with the usual relational semantics) that admits $\gamma $ by the method of normal models. We also note the circumstances in which our results apply to logics without fusion and the Ackermann truth constant.

Although many fields of study have been radically reshaped by feminist critiques, formal a priori disciplines like mathematics and computer science have proven more intransigent; feminist critiques have largely emphasized goals like increasing enrollment or participation in these fields, stopping short of proposing radical critiques of their theoretical foundations. In this paper, we discuss how Valerie Plumwood’s work on reading classical logic as a logic of domination can be extended to provide grounds for authentic feminist theories of mathematics. We argue that the relevant arithmetic $$\mathsf{R}^{\sharp}$$ described by Plumwood’s collaborator Robert K. Meyer satisfies the criteria characteristic of a Plumwoodian critique of arithmetic. The setting of $$\mathsf{R}^{\sharp}$$ is finally used to investigate several consequences of such an approach, including the degree to which such an arithmetic parts ways with classical mathematics as regards arithmetical truths.

Large language models (LLMs) have demonstrated impressive capabilities in natural language understanding and generation, but they exhibit problems with logical consistency in the output they generate. How can we harness LLMs' broad-coverage parametric knowledge in formal reasoning despite their inconsistency? We present a method for directly integrating an LLM into the interpretation function of the formal semantics for a paraconsistent logic. We provide experimental evidence for the feasibility of the method by evaluating the function using datasets created from several short-form factuality benchmarks. Unlike prior work, our method offers a theoretical framework for neuro-symbolic reasoning that leverages an LLM's knowledge while preserving the underlying logic's soundness and completeness properties.

The family of relevant logics can be faceted by a hierarchy of increasingly fine-grained variable sharing properties—requiring that in valid entailments $A\to B$, some atom must appear in both A and B with some additional condition (e.g., with the same sign or nested within the same number of conditionals). In this paper, we consider an incredibly strong variable sharing property of lericone relevance that takes into account the path of negations and conditionals in which an atom appears in the parse trees of the antecedent and consequent. We show that this property of lericone relevance holds of the relevant logic $\mathbf {BM}$ (and that a related property of faithful lericone relevance holds of $\mathbf {B}$ ) and characterize the largest fragments of classical logic with these properties. Along the way, we consider the consequences for lericone relevance for the theory of subject-matter, for Logan’s notion of hyperformalism, and for the very definition of a relevant logic itself.

Kit Fine’s truthmaker semantics allows us to distinguish between implying and containing: A implies B iff every truthmaker of A includes (as a part) a truthmaker of B, and A contains B iff every truthmaker of B is included (as a part) in a truthmaker of A. These are two different notions that can both be transformed into a proper object language connective. While the former notion amounts to the usual notion of implication, the latter one leads to a novel connective with interesting logical properties. In this paper we put forward a truthmaker semantics for the implication of the relevant logic R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathsf {R}$$ \end{document} and we accompany it with the corresponding “containing” operator. This framework will allow us to relate two seemingly very different kinds of relevant implication that has so far been studied separately, namely the implication of the logic R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathsf {R}$$ \end{document} and Angell’s analytic containment. Our approach semantically determines a logic that we call RAC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathsf {RAC}$$ \end{document}. We explore its connection to R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathsf {R}$$ \end{document}, the logic of analytic containment AC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathsf {AC}$$ \end{document}, Urquhart’s operational semantics and inquisitive semantics.

In the canon of relevant logic—Entailment, Relevant Logics and Their Rivals, Directions in Relevant Logic—space has typically been made for acknowledging containment logics in the style of W.T. Parry or R.B. Angell. Although containment logics’ satisfaction of the relevant logics’ key variable-sharing criterion and are thus relevant, the tenor of such acknowledgement has typically been strained—ranging from grudging to adversarial. This familial estrangement has prevented the relevantist from reaping the fruits offered by her cousin, of course. I would like to suggest in this note that the fruits are not meager—especially in light of current work on the theory of subject-matter—and that the containment logician might have some worthwhile words of advice with respect to variable-sharing.

The paper introduces a relevant containment logic according to which the analytic implication $$\varphi \twoheadrightarrow \psi$$ φ ↠ ψ is analyzed as the conjunction of two theses: $$\varphi$$ φ contextually entails $$\psi$$ ψ and $$\varphi$$ φ contextually contains $$\psi$$ ψ. By doing so, we are able to extend the ternary semantics of relevant logic to the analysis of topic containment, thus lifting some limitations of Richard Sylvan’s relevant containment logic. We offer a ternary account of topic containment, in that led by the consideration that topic inclusions are evaluated in situ, i.e. with respect to the discursive context fixed by an information state. The main technical result of the paper is a sound and complete axiomatisation of relevant containment logic. Finally, Sylvan’s logic turns out as a special case of our relevant containment logic.

The paper extends a framework of information-based semantics for intuitionistic logic with a paraconsistent negation and consistency-sensitive epistemic modalities. In this framework information states represent information collected from various sources and as such they can be inconsistent because they receive contradictory information either from a single inconsistent source or from various mutually incompatible sources. The modalities reflect only those sources that are consistent and trusted. For the paraconsistent logic generated by this framework, we present a Hilbert style system, we prove completeness, the disjunction property, the finite model property and various other results.

Like many intensional logics, William Parry’s logic of analytic implication PAI admits extensions determined by imposing semantic conditions on its account of modality. PAI is unique, however, in its allowing a second dimension—a topic-theoretic dimension—along which extensions can be defined. The recent introduction by Francesco Berto of topic-sensitive intentional modals (TSIMs)—which disagree with PAI on this type of condition—provide further motivations to examine such topic-theoretic extensions. In this paper, we introduce, motivate, and characterize a number of such extensions of PAI, paying special attention to applications to Berto’s framework and to ways in which the modal and topic-theoretic dimensions influence one another.

In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak relevant logics B\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{B}}$$\end{document} and BM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\textbf{B}}}{{\textbf{M}}}$$\end{document}, respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance.

In frameworks in which _topic-__theoretic_ considerations—_e.g._, tracking _subject-matter_ or _topic_—are given equal importance with _veridical_ considerations, assigning topics to formulae in a satisfactory way is of critical importance. While intuitions are more-or-less solid for _extensional_ formulae in a propositional language, arriving at a compelling account of the subject-matter of _intensional_ formulae, _i.e._, formulae including intensional operators, is more challenging. This paper continues previous work on modeling topics of intensional formulae in William Parry’s logic of analytic implication, adapting the general techniques to the framework of _topic-sensitive intentional modals_ (TSIMs) championed by Francesco Berto and his collaborators. As illustrations, we introduce variations on Berto and Peter Hawke’s logic of knowability relative to information ( \(\pmb {\textsf{KRI}}\) ), including a refinement sensitive to topic-theoretic distinctions between knowledge and belief and a refinement capable of internalizing its own properties. Finally, subsystems of Aybüke Ozgun and Berto’s logic of plain hyperintensional belief ( \(\pmb {\textsf{PHB}}\) ) are introduced in which fine-grained distinctions in subject-matter are possible.

In this paper, the notion of structural completeness is explored in the context of a generalized class of superintuitionistic logics involving also systems that are not closed under uniform substitution. We just require that each logic must be closed under D-substitutions assigning to atomic formulas only ∨\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee $$\end{document}-free formulas. For these systems we introduce four different notions of structural completeness and study how they are related. We focus on superintuitionistic inquisitive logics that validate a schema called Split and have the disjunction property. In these logics disjunction can be interpreted in the sense of inquisitive semantics as a question forming operator. It is shown that a logic is structurally complete with respect to D-substitutions if and only if it includes the weakest superintuitionistic inquisitive logic. Various consequences of this result are explored. For example, it is shown that every superintuitionistic inquisitive logic can be characterized by a Kripke model built up from D-substitutions. Additionally, we resolve a conjecture concerning superintuitionistic inquisitive logics due to Miglioli et al..

Logical frameworks that are sensitive to features of sentences’ subject-matter—like Berto’s topic-sensitive intentional modals (TSIMs)—demand a maximally faithful model of the topics of sentences. This is an especially difficult task in the case in which topics are assigned to intensional formulae. In two previous papers, a framework was developed whose model of intensional subject-matter could accommodate a wider range of intuitions about particular intensional conditionals. Although resolving a number of counterintuitive features, the work made an implicit assumption that the subject-matter of an intensional conditional is a function of the subject-matters of its subformulae. This assumption—which I will call a principle of topic sufficiency—runs counter to some natural intuitions concerning topic. In this paper, we will investigate topic sufficiency and offer a semantic account that is state-sensitive, providing an implementation through the introduction of topic-sensitive logics related to William Parry’s prototypical $\mathsf {PAI}$.

A key facet of Valerie Plumwood’s feminist critique of logic is her analysis of classical negation. On Plumwood’s reading, the exclusionary features of classical negation generate hierarchical dualisms, i.e., dichotomies in which dominant groups’ primacy is reinforced while underprivileged groups are oppressed. For example, Plumwood identifies the system collapse following from ex contradictione quodlibet—that a theory including both φ and ∼φ trivializes—as a primary source of many of these features. Although Plumwood considers the principle of excluded middle to be compatible with her goals, that she identifies relevant logics as systems lacking a hierarchical negation—whose first-degree fragments are both paraconsistent and paracomplete—suggests that excluded middle plays some role in hierarchical dualisms as well. In these notes, I examine the role of excluded middle in generating oppressive homogenization and try to clarify the relationship between Plumwood’s critique and this principle from several contemporary perspectives. Finally, I examine the matter of whether Plumwood’s critique requires relevance or whether a non-relevant logic could satisfy her criteria and serve as a liberatory logic of difference.

Although the work of G.F.C. Griss is commonly understood as a program of negationless mathematics, close examination of Griss’s work suggests a more fundamental feature is its executability, a requirement that mental constructions are possible only if corresponding mental activity can be actively carried out. Emphasizing executability reveals that Griss’s arguments against negation leave open several types of negation—including D. Nelson’s strong negation—as compatible with Griss’s intuitionism. Reinterpreting Griss’s program as one of executable mathematics, we iteratively develop a pair of bilateral constructive logics and argue for their adequacy as accounts of the propositional basis of Griss’s work. We conclude by observing connexive features exhibited by the two bilateral logics and by investigating the difficulties connexive principles reveal for the development of executable mathematics.

Meyer and Mortensen’s Alien Intruder Theorem includes the extraor- dinary observation that the rationals can be extended to a model of the relevant arithmetic R♯, thereby serving as integers themselves. Al- though the mysteriousness of this observation is acknowledged, little is done to explain why such rationals-as-integers exist or how they operate. In this paper, we show that Meyer and Mortensen’s models can be identified with a class of ultraproducts of finite models of R♯, providing insights into some of the more mysterious phenomena of the rational models.

Although logical settings are typically concerned with tracking alethic considerations, frameworks exist in which topic-theoretic considerations—e.g., tracking subject-matter or topic—are given equal importance. Intuitions about extending topic through a propositional language are generally straightforward for extensional cases. For a number of reasons, arriving at a compelling account of the subject-matter of intensional operators—such as intensional conditionals—is a more difficult task. In particular, the framework of topic-sensitive intentional modals (TSIMs) championed by Francesco Berto and his collaborators leave the topics of intensional formulae undefined, which artificially constricts the expressivity of the theory. This paper proposes an approach to fill in this lacuna, emphasizing an analogous problem in Parry-style containment logics. In this setting, the approach receives a proof-of-concept through the introduction of a natural and general family of subsystems of Parry’s $${\textsf{PAI}}$$ PAI —with sound and complete axiomatizations—that allow a fine degree of control over the topics of intensional conditionals.

The mathematician G.F.C. Griss is known for his program of negationless intuitionistic mathematics. Although Griss’s rejection of negation is regarded as characteristic of his philosophy, this is a consequence of an executability requirement that mental constructions presuppose agents’ executing corresponding mental activity. Restoring Griss’s executability requirement to a central role permits a more subtle characterization of the rejection of negation, according to which D. Nelson’s strong constructible negation is compatible with Griss’s principles. This exposes a ‘holographic’ theory of negation in negationless mathematics, in which a full theory of negation is ‘flattened’ in a putatively negationless setting.

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with multiple contaminating values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper.

Bounds consequence provides an interpretation of a multiple-conclusion consequence relation in which the derivability of a sequent is understood as the claim that it is conversationally out-of-bounds to take a position in which each member of Γ is asserted while each member of Δ is denied. Two of the foremost champions of bounds consequence—Greg Restall and David Ripley—have independently indicated that the shape of the bounds in question is determined by conversational practice. In this paper, I suggest that the standard treatments of bounds consequence have focused heavily on the matter of veridicality at the expense of ignoring other features by which conversational bounds are set, prime among them being the matter of content or subject-matter. Furthermore, I argue that the semantic behavior of propositions containing “monstrous” content—content whose introduction is inappropriate to a context independently of veridical considerations—leads to a weak Kleene account of bounds consequence.

In this chapter, the correspondence between the present many-valued semantics for $$\mathsf {AC}$$ AC and those of Correia is revisited and studied in more details. The technique that plays an essential role in proving the completeness of the many-valued semantics for $$\mathsf {AC}$$ AC in Chap. 4 is used to characterize a wide class of first-degree calculi intermediate between $$\mathsf {AC}$$ AC and classical logic in Correia’s setting. This correspondence allows the correction of an incorrect characterization of classical logic made by Correia and leads to the question of how to characterize hybrid systems extending Angell’s $$\mathsf {AC}^{*}$$ AC ∗. Finally, we consider whether this correspondence aids in providing an interpretation to Correia’s first semantics for $$\mathsf {AC}$$ AC.

In this chapter, we consider interpretations of disjunction that accord with a characteristic feature of Parry logics: the failure of Addition. In such a context, the evaluation of a disjunction $$A\vee B$$ A ∨ B requires not only the truth of one disjunct, but also that both disjuncts satisfy some further property. In the setting of computation, such an analysis requires the existence of some procedure tasked with ensuring the satisfaction of this property by both disjuncts. This observation leads to a computational analysis of the relationship between Parry logics and logics of nonsense in which the semantic category of ‘nonsense’ is associated with catastrophic faults in computer programs. In this spirit, we examine semantics for several $$\vdash $$ ⊢ -Parry logics in terms of the successful execution of certain types of programs and the consequences of extending this analysis to dynamic logic and constructive logic.