Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Single axioms in the implicational propositional calculus

  • Conference paper
  • First Online:
9th International Conference on Automated Deduction (CADE 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 310))

Included in the following conference series:

Abstract

A class of challenge problems derived from a first-order encoding of the implicational propositional calculus is presented.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jan Łukasiewicz. The shortest axiom of the implicational calculus of propositions. Proceedings of the Royal Irish Academy, 52(3):25–33, April 1948.

    Google Scholar 

  2. Jan Łukasiewicz. The shortest axiom of the implicational calculus of propositions. In L. Borowski, editor, Jan Łukasiewicz, Selected Works, pages 295–305, North-Holland, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pfenning, F. (1988). Single axioms in the implicational propositional calculus. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012869

Download citation

  • DOI: https://doi.org/10.1007/BFb0012869

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19343-2

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics