Skip to main content

Computational aspects of three-valued logic

  • Nondassical Deducation
  • Conference paper
  • First Online:
Book cover 8th International Conference on Automated Deduction (CADE 1986)

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

Included in the following conference series:

Abstract

This paper investigates a three-valued logic L3, that has been introduced in the study of natural language semantics. A complete proof system based on a three-valued analogon of negative resolution is presented. A subclass of L3 corresponding to Horn clauses in two-valued logic is defined. Its model theoretic properties are studied and it is shown to admit a PROLOG-style proof procedure.

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. J. Barwise and J. Perry. 1983 Situations and Attitudes. Bradford Books, Cambridge, Mass.

    Google Scholar 

  2. S.Blamey. Partial logic. In: (Gabbay and Guenthner 1986), p.1–70.

    Google Scholar 

  3. U.Blau. Die dreiwertige Logik der Sprache. Walter de Gruyter.

    Google Scholar 

  4. J.M. Dunn and G. Epstein (eds.). 1977 Modern Uses of Multiple-Valued Logic. D.Reidel Publish. Co., Dordrecht.

    Google Scholar 

  5. H.-D. Ebbinghaus. 1969 Über eine Prädikatenlogik mit partiell definierten Prädikaten und Funktionen. Archiv für mathematische Logik 12, p.39–53.

    Google Scholar 

  6. J.E.Fenstad, P.-K.Halvorsen, T.Langholm and J.van Benthem. Equations, Schemata and Situations: A framework for linguistic semantics. CSLI Report No. 29. Center For The Study Of Language And Information, Stanford, CA 94305.

    Google Scholar 

  7. D. Gabbay and F. Guenthner (eds.). Handbook of Philosophical Logic, Vol.III: Alternatives in Classical Logic. D. Reidel Publishing Co., Dordrecht.

    Google Scholar 

  8. T.Langholm. Characterizations of persistent formulas in a three-valued logic. University of Oslo, Sweden.

    Google Scholar 

  9. J.A.Makowski. Why Horn formulas matter in computer science: initial structures and generic examples. Techn.Report No.329, Technion, Haifa.

    Google Scholar 

  10. S.McCall (ed.). Polish Logic 1920–1939. Oxford.

    Google Scholar 

  11. C.G. Morgan. 1973 A Resolution Procedure For A Class Of Many-valued Logics. Journal of Symbolic Logic vol. 39, 199–200 (abstract).

    Google Scholar 

  12. N. Rescher. 1969 Many-Valued Logic. McGraw Hill Book Co., New York.

    Google Scholar 

  13. J.B. Rosser and A.R. Turquette. 1952 Many-Valued Logics. North-Holland Publishing Co., Amsterdam.

    Google Scholar 

  14. J. Slupecki. 1936 Der volle dreiwertige Aussagenkalkül. Comptes rendues des s&eaccr.ance de la Soci&eaccr.t&eaccr. des Science de Lettres de Varsovie, Classe III, vol. 29, 9–11. English translation in (McCall) 335–337.

    Google Scholar 

  15. A.Urquhart. Many-valued logic. In: (Gabbay and Guenthner 1986), p.71–116.

    Google Scholar 

  16. H.Volger. On Theories which Admit Initial Structures. FNS-Bericht 85-1. Universität Tübingen, Forschungsstelle für natürlich-sprachige Systeme.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmitt, P.H. (1986). Computational aspects of three-valued logic. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics