Thomas Ferguson

In the field of logics of formal inconsistency, the notion of “consistency” is frequently too broad to draw decisive conclusions with respect to the validity of many theses involving the consistency connective. In this paper, we consider the matter of the axiom 0—i.e., the schema ◦ ◦ϕ—by considering its interpretation in contexts in which “consistency” is understood as a type of verifiability. This paper suggests that such an interpretation is implicit in two extracanonical LFIs—Sören Halldén’s nonsense-logic C and Graham Priest’s cointuitionistic logic daC—drawing some interesting conclusions concerning the status of 0. Initially, we discuss Halldén’s skepticism of this axiom and provide a plausible counterexample to its validity. We then discuss the interpretation of the operator in Priest’s daC and show the equivalence of 0 to the intuitionistic principle of testability. These observations suggest that it may be fruitful for members of the LFI community to look outside the canon for evidence concerning the adoption of principles like 0.

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.

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.

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.

Graham Priest has frequently employed a construction in which a classical first-order model \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathfrak {A}$$\end{document} may be collapsed into a three-valued model \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathfrak {A}^{\sim }$$\end{document} suitable for interpretations in Priest’s logic of paradox. The source of this construction’s utility is Priest’s Collapsing Lemma, which guarantees that a formula true in the model \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathfrak {A}$$\end{document} will continue to be true in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathfrak {A}^{\sim }$$\end{document}. In light of the utility and elegance of the Collapsing Lemma, extending variations of the lemma to other deductive calculi becomes very attractive. The aim of this paper is to map out some of the frontiers of the Collapsing Lemma by describing the types of expansions or revisions to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {LP}$$\end{document} for which the Collapsing Lemma continues to hold and a number of cases in which the lemma cannot be salvaged. Among what is shown is that the lemma holds for a strictly more expressive form of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {LP}$$\end{document} including nullary truth and falsity constants, that any conditional connective that can be added to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {LP}$$\end{document} without inhibiting the lemma must be theoremhood-preserving, and that the Collapsing Lemma extends to the paraconsistent weak Kleene logic \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PWK}$$\end{document} as well.

While participating in a symposium on Dave Ripley’s forthcoming book Uncut, I had proposed that employing a strict-tolerant interpretation of the weak Kleene matrices provided a content-theoretical conception of the bounds of conversational norms that enjoyed advantages over Ripley’s use of the strong Kleene matrices. During discussion, I used the case of sentences that are taken to be out-of-bounds for being secrets as an example of a case in which the setting of conversational bounds in practice diverged from the account championed by Ripley. In this paper, I consider an objection that my treatment of quantifiers was mistaken insofar as the confidentiality of a sentence ϕ may not lift to the sentence ∃xϕ and draw from this objection that neither the strong nor the weak Kleene interpretation of quantifiers suffices, but that a novel interpretation may do so.

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..