Switch to: References

Citations of:

Relevant Robinson's arithmetic

Studia Logica 38 (4):407 - 418 (1979)

Add citations

You must login to add citations.
  1. Relevant Robinson's arithmetic.J. Michael Dunn - 1979 - Studia Logica 38 (4):407 - 418.
    In this paper two different formulations of Robinson's arithmetic based on relevant logic are examined. The formulation based on the natural numbers (including zero) is shown to collapse into classical Robinson's arithmetic, whereas the one based on the positive integers (excluding zero) is shown not to similarly collapse. Relations of these two formulations to R. K. Meyer's system R# of relevant Peano arithmetic are examined, and some remarks are made about the role of constant functions (e.g., multiplication by zero) in (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • From Hilbert proofs to consecutions and back.Tore Fjetland Øgaard - 2021 - Australasian Journal of Logic 18 (2):51-72.
    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 calculus (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Relevant predication 1: The formal theory. [REVIEW]J. Michael Dunn - 1987 - Journal of Philosophical Logic 16 (4):347-381.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • In memoriam: J. Michael Dunn, 1941–2021.Katalin Bimbó - 2021 - Bulletin of Symbolic Logic 27 (4):519-525.
    Download  
     
    Export citation  
     
    Bookmark  
  • Substitution in relevant logics.Tore Fjetland Øgaard - 2019 - Review of Symbolic Logic (3):1-26.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Ultralogic as Universal?: The Sylvan Jungle - Volume 4.Richard Routley - 2019 - Cham, Switzerland: Springer Verlag.
    Ultralogic as Universal? is a seminal text in non-classcial logic. Richard Routley presents a hugely ambitious program: to use an 'ultramodal' logic as a universal key, which opens, if rightly operated, all locks. It provides a canon for reasoning in every situation, including illogical, inconsistent and paradoxical ones, realized or not, possible or not. A universal logic, Routley argues, enables us to go where no other logic—especially not classical logic—can. Routley provides an expansive and singular vision of how a universal (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Paraconsistent Measurement of the Circle.Zach Weber & Maarten McKubre-Jordens - 2017 - Australasian Journal of Logic 14 (1).
    A theorem from Archimedes on the area of a circle is proved in a setting where some inconsistency is permissible, by using paraconsistent reasoning. The new proof emphasizes that the famous method of exhaustion gives approximations of areas closer than any consistent quantity. This is equivalent to the classical theorem in a classical context, but not in a context where it is possible that there are inconsistent innitesimals. The area of the circle is taken 'up to inconsistency'. The fact that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Conditionals, quantification, and strong mathematical induction.Daniel H. Cohen - 1991 - Journal of Philosophical Logic 20 (3):315 - 326.
    Download  
     
    Export citation  
     
    Bookmark