Inconsistent Models (and Infinite Models) for Arithmetics with Constructible Falsity

An earlier paper on formulating arithmetic in a connexive logic ended with a conjecture concerning C♯ , the closure of the Peano axioms in Wansing’s connexive logic C. Namely, the paper conjectured that C♯ is Post consistent relative to Heyting arithmetic, i.e., is nontrivial if Heyting arithmetic is nontrivial. The present paper borrows techniques from relevant logic to demonstrate that C♯ is Post consistent simpliciter, rendering the earlier conjecture redundant. Given the close relationship between C and Nelson’s paraconsistent N4, this also supplements Nelson’s own proof of the Post consistency of N4♯ . Insofar as the present technique allows infinite models, this resolves Nelson’s concern that N4♯ is of interest only to those accepting that there are finitely many natural numbers

Relevant Logics Obeying Component Homogeneity

This paper discusses three relevant logics that obey Component Homogeneity - a principle that Goddard and Routley introduce in their project of a logic of significance. The paper establishes two main results. First, it establishes a general characterization result for two families of logic that obey Component Homogeneity - that is, we provide a set of necessary and sufficient conditions for their consequence relations. From this, we derive characterization results for S*fde, dS*fde, crossS*fde. Second, the paper establishes complete sequent calculi for S*fde, dS*fde, crossS*fde. Among the other accomplishments of the paper, we generalize the semantics from Bochvar, Hallden, Deutsch and Daniels, we provide a general recipe to define containment logics, we explore the single-premise/single-conclusion fragment of S*fde, dS*fde, crossS*fdeand the connections between crossS*fde and the logic Eq of equality by Epstein. Also, we present S*fde as a relevant logic of meaninglessness that follows the main philosophical tenets of Goddard and Routley, and we briefly examine three further systems that are closely related to our main logics. Finally, we discuss Routley's criticism to containment logic in light of our results, and overview some open issues

Parity, Relevance, and Gentle Explosiveness in the Context of Sylvan's Mate Function

The Routley star, an involutive function between possible worlds or set-ups against which negation is evaluated, is a hallmark feature of Richard Sylvan and Val Plumwood's set-up semantics for the logic of first-degree entailment. Less frequently acknowledged is the weaker mate function described by Sylvan and his collaborators, which results from stripping the requirement of involutivity from the Routley star. Between the mate function and the Routley star, however, lies an broad field of intermediate semantical conditions characterizing an infinite number of consequence relations closely related to first-degree entailment. In this paper, we consider the semantics and proof theory for deductive systems corresponding to set-up models in which the mate function is cyclical. We describe modifications to Anderson and Belnap's consecution calculus LE_fde2 that correspond to these constraints, for which we prove soundness and completeness with respect to the set-up semantics. Finally, we show that a number of familiar metalogical properties are coordinated with the parity of a mate function's period, including refined versions of the variable-sharing property and the property of gentle explosiveness

From Excluded Middle to Homogenization in Plumwood’s Feminist Critique of Logic

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

Robert Meyer's Publications on Relevant Arithmetic

This is a bibliography of R.K. Meyer's published articles on relevant arithmetic

Robert Meyer's Publications on Relevant Arithmetic

This is a bibliography of R.K. Meyer's published articles on relevant arithmetic

Introduction

This is the introduction to the special issue on Robert K. Meyer and the philosophy of arithmetic

Episodes in Model-Theoretic Xenology: Rationals as Positive Integers in R#

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

Episodes in Model-Theoretic Xenology: Rationals as Positive Integers in R#

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