Skip to main content
SpringerLink
Log in

More Proofs of an Axiom of Łukasiewicz

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This paper reports results and some new problems in one of the domains to which automatic first-order theorem provers have been most successfully applied: axiomatics of nonclassical propositional logics. It is well known that one of the standard axioms of the denumerable-valued pure implication logic of Łukasiewicz becomes derivable from the remainder in the presence of negation. Here it is shown that the same axiom is similarly derivable using conjunction and disjunction instead of negation. This closes a problem left open by Harris and Fitelson (Journal of Automated Reasoning 27, 2001). Related problems are discussed, and five such open problems are proposed as challenges to the automated reasoning community.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Anderson, A. and Belnap, N.: Entailment: The Logic of Relevance and Necessity, Vol. 1, Princeton University Press, 1975.

  • Chang, C.: Proof of an axiom of Łukasiewicz, Trans. Amer. Math. Soc. 87 (1958), 55–56.

    Google Scholar 

  • Harris, K. and Fitelson, B.: Distributivity in Łℵ0 and other sentential logics, J. Automated Reasoning 27 (2001), 141–156.

    Google Scholar 

  • Meredith, C.: The dependence of an axiom of Łukasiewicz, Trans. Amer. Math. Soc. 87 (1958), 54.

    Google Scholar 

  • Restall, G.: An Introduction to Substructural Logics, Routledge, 2000.

  • Rose, A. and Rosser, J.: Fragments of many-valued statement calculi, Trans. Amer. Math. Soc. 87 (1958), 1–53.

    Google Scholar 

  • Slaney, J.: MaGIC, matrix generator for implication connectives: Notes and guide, Technical Report TR-ARP-11-95, Automated Reasoning Project, Australian National University, 1995.

  • Sutcliffe, G. and Suttner, C.: The TPTP problem library: The CNF release v.1.2.1, J. Automated Reasoning 21 (1998), 177–203.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Australian National University, Canberra, ACT, 0200, Australia

    John Slaney

Authors
  1. John Slaney
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Slaney, J. More Proofs of an Axiom of Łukasiewicz. Journal of Automated Reasoning 29, 59–66 (2002). https://doi.org/10.1023/A:1020541318160

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020541318160

Search

Navigation