•  848
    Prospects for a Naive Theory of Classes
    Notre Dame Journal of Formal Logic 58 (4): 461-506. 2017.
    The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identi…Read more
  •  256
    Paths to Triviality
    Journal of Philosophical Logic 45 (3): 237-276. 2016.
    This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An overview over various ways to formulate Leibniz’s …Read more
  •  193
    From Hilbert proofs to consecutions and back
    Australasian Journal of Logic 18 (2): 51-72. 2021.
    Restall set forth a "consecution" calculus in his "An Introduction to Substructural Logics." This is a natural deduction type sequent calculus where the structural rules play an important role. This paper looks at different ways of extending Restall's calculus. It is shown that Restall's weak soundness and completeness result with regards to a Hilbert calculus can be extended to a strong one so as to encompass what Restall calls proofs from assumptions. It is also shown how to extend the calcul…Read more
  •  44
    Substitution in relevant logics
    Review of Symbolic Logic (3): 1-26. 2019.
    This essay discusses rules and semantic clauses relating to Substitution—Leibniz’s law in the conjunctive-implicational form s=t ∧ A(s) → A(t)—as these are put forward in Priest’s books "In Contradiction" and "An Introduction to Non-Classical Logic: From If to Is." The stated rules and clauses are shown to be too weak in some cases and too strong in others. New ones are presented and shown to be correct. Justification for the various rules are probed and it is argued that Substitution ought to f…Read more
  •  36
    Confused Entailment
    Topoi 41 (1): 207-219. 2021.
    Priest argued in Fusion and Confusion (Priest in Topoi 34(1):55–61, 2015a) for a new concept of logical consequence over the relevant logic B, one where premises my be “confused” together. This paper develops Priest’s idea. Whereas Priest uses a substructural proof calculus, this paper provides a Hilbert proof calculus for it. Using this it is shown that Priest’s consequence relation is weaker than the standard Hilbert consequence relation for B, but strictly stronger than Anderson and Belnap’s …Read more
  •  35
    Boolean negation and non-conservativity I: Relevant modal logics
    Logic Journal of the IGPL 29 (3): 340-362. 2021.
    Many relevant logics can be conservatively extended by Boolean negation. Mares showed, however, that E is a notable exception. Mares’ proof is by and large a rather involved model-theoretic one. This paper presents a much easier proof-theoretic proof which not only covers E but also generalizes so as to also cover relevant logics with a primitive modal operator added. It is shown that from even very weak relevant logics augmented by a weak K-ish modal operator, and up to the strong relevant logi…Read more
  •  33
    Boolean negation and non-conservativity III: the Ackermann constant
    Logic Journal of the IGPL 29 (3): 370-384. 2021.
    It is known that many relevant logics can be conservatively extended by the truth constant known as the Ackermann constant. It is also known that many relevant logics can be conservatively extended by Boolean negation. This essay, however, shows that a range of relevant logics with the Ackermann constant cannot be conservatively extended by a Boolean negation.
  •  32
    This paper gives an account of Anderson and Belnap’s selection criteria for an adequate theory of entailment. The criteria are grouped into three categories: criteria pertaining to modality, those pertaining to relevance, and those related to expressive strength. The leitmotif of both this paper and its prequel is the relevant legitimacy of disjunctive syllogism. Relevant logics are commonly held to be paraconsistent logics. It is shown in this paper, however, that both E and R can be extended t…Read more
  •  30
    Skolem Functions in Non-Classical Logics
    Australasian Journal of Logic 14 (1): 181-225. 2017.
    This paper shows how to conservatively extend theories formulated in non-classical logics such as the Logic of Paradox, the Strong Kleene Logic and relevant logics with Skolem functions. Translations to and from the language extended by Skolem functions into the original one are presented and shown to preserve derivability. It is also shown that one may not always substitute s=f(t) and A(t, s) even though A determines the extension of a function and f is a Skolem function for A.
  •  23
    Non-Boolean classical relevant logics I
    Synthese (8): 1-32. 2019.
    Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary property for a logic t…Read more
  •  21
    Boolean negation and non-conservativity II: The variable-sharing property
    Logic Journal of the IGPL 29 (3): 363-369. 2021.
    Many relevant logics are conservatively extended by Boolean negation. Not all, however. This paper shows an acute form of non-conservativeness, namely that the Boolean-free fragment of the Boolean extension of a relevant logic need not always satisfy the variable-sharing property. In fact, it is shown that such an extension can in fact yield classical logic. For a vast range of relevant logic, however, it is shown that the variable-sharing property, restricted to the Boolean-free fragment, still…Read more
  •  19
    Farewell to Suppression-Freedom
    Logica Universalis 14 (3): 297-330. 2020.
    Val Plumwood and Richard Sylvan argued from their joint paper The Semantics of First Degree Entailment and onward that the variable sharing property is but a mere consequence of a good entailment relation, indeed they viewed it as a mere negative test of adequacy of such a relation, the property itself being a rather philosophically barren concept. Such a relation is rather to be analyzed as a sufficiency relation free of any form of premise suppression. Suppression of premises, therefore, gaine…Read more
  •  12
    Relevance through topical unconnectedness
    Australasian Journal of Logic 20 (2): 154-187. 2023.
    Ackermann’s motivational spin on his theory of rigorous implication is analyzed and it is shown to contain en equivalent idea to Plumwood’s notion of suppression freedom. The formal properties these ideas back turn out to be properly weaker than Belnap’s variable sharing property, but it is shown that they can be strengthen in various ways. Some such strengthenings, it is shown, yield properties which are equivalent to Belnap’s, and thus provide for new ways of motivating Belnap’s fundamental re…Read more
  •  6
    The Weak Variable Sharing Property
    Bulletin of the Section of Logic (1): 85-99. 2023.
    An algebraic type of structure is shown forth which is such that if it is a characteristic matrix for a logic, then that logic satisfies Meyer's weak variable sharing property. As a corollary, it is shown that RM and all its odd-valued extensions \(\mathbf{RM}_{2n\mathord{-}1}\) satisfy the weak variable sharing property. It is also shown that a proof to the effect that the "fuzzy" version of the relevant logic R satisfies the property is incorrect.