Skip to main content
SpringerLink
Log in

Analytic tableaux for finite and infinite Post logics

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

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

  • 182 Accesses

Abstract

We present a tableau-based calculus for the finite and infinite valued Post logics, well suited for automated deduction. We use a possible world semantics and a prefixed tableau calculus based on it. The formula prefixes contain arithmetical expressions and variables. The world-information is handled by solving constraints which express ordering problems. Some hints of future work are given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Dahn. Kripke-style semantics for some many-valued propositional calculi. Bulletin de I'Académie Polonaise des Sciences. série des sciences math., astr. et phys., XXII(2):99–102, 1974.

    Google Scholar 

  2. Michael Dummett. A propositional calculus with denumerable matrix. Journal of Symbolic Logic, 24(2):97–106, June 1959.

    Google Scholar 

  3. Melvin Fitting. First Order Logic and Automated theorem Proving. Springer-Verlag, 1990.

    Google Scholar 

  4. Reiner Hähnle. Automated Theorem Proving in Multiple Valued Logics. Oxford University Press. to appear.

    Google Scholar 

  5. Ronald Harrop. Some structure results for propositional calculi. Journal of Symbolic Logic, 30(3):271–292, September 1965.

    Google Scholar 

  6. G. E. Hughes and M. J. Cresswell. A Companion to Modal Logic. Methuen, 1984.

    Google Scholar 

  7. L. Maksimova and D. Vakarelov. Semantics for ω+-valued predicate calculi. Bulletin de l'Académie Polonaise des Sciences. série des sciences math., astr. et phys., XXII(8):765–771, 1974.

    Google Scholar 

  8. Ewa Orlowska. The Gentzen style axiomatisation of ω+-valued logic. Studia Logica, 35(4):433–445, 1976.

    Google Scholar 

  9. Raymond M. Smullyan. First Order Logic. Springer-Verlag, 1968.

    Google Scholar 

  10. Dirk van Dalen. Intuitionistic logic. In Dov Gabbay and Fianz Günthner, editors, Handbook of Philosophical Logic, vol. III: Alternatives of classical logic, volume 166 of Synthese Library, chapter III.4, pages 225–240. Reidel, 1986.

    Google Scholar 

  11. Nicolas Zabel. Nouvelles techniques de deduction automatique en logiques polyvalentes du premier ordre, finies et infinies. Thèse, Institut National Polytechnique de Grenoble, 1992. forthcoming.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFIA-IMAG, 46, Av. Félix Viallet, F 38 031, Grenoble Cedex, France

    Nicolas Zabel

Authors
  1. Nicolas Zabel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zabel, N. (1993). Analytic tableaux for finite and infinite Post logics. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation