Skip to main content

Some Criteria of Decidability for Axiomatic Systems in Three-Valued Logic

  • Conference paper
Logic, Language, and Computation (TbiLLC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4363))

Included in the following conference series:

  • 649 Accesses

Abstract

Two criteria of decidability for axiomatic systems based on J.Lukasiewicz’s three-valued logic are established.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bols, L., Borowik, P.: Many-valued Logics1: Theoretical Foundations. Springer, Heidelberg (1992)

    Google Scholar 

  2. Enderton, H.B.: A Mathematical Introduction to Logic, 2nd edn. Academic Press, San Diego, Harcourt (2001)

    MATH  Google Scholar 

  3. Ershov, Y.L.: Problems of Decidability and Constructive Models (in Russian). Nauka, Moskow (1980)

    Google Scholar 

  4. Kleene, S.C.: Introduction to Metamathematics. D.van Nostrand Comp., Inc., New York - Toronto (1952)

    MATH  Google Scholar 

  5. Lukasiewicz, J.: O logice trojwartosciowej (in Polish). Ruch filozoficzny (Lwow) N5, 168–171 (1920)

    Google Scholar 

  6. Zaslavsky, I.D.: Symmetric Constructive Logic (in Russian). Publ. House of Acad. Sci. Arm. SSR (1978)

    Google Scholar 

  7. Zaslavsky, I.D.: On a logically but not functionally complete calculus in three-valued logic. In: The Tbilisi Symposium on Logic, Language and Computation, selected papers, pp. 309–313. CSLI publications, Stanford, California (1998)

    Google Scholar 

  8. Zaslavsky, I.D.: On the Completeness Properties of the Systems of Symmetric Constructive and Three-valued Logic. In: International Conference “21st Days of Weak Arithmetics”, St.Petersburg, Russia, June 7-9, 2002, pp. 17–18. Abstracts, St.Petersburg (2002), URL http://at.yorku.ca/cgi-bin/amca/cail-01

    Google Scholar 

  9. Zaslavsky, I.D.: Formal axiomatic theories on the base of three-valued logic (in Russian). In: Zapiski nauchnykh seminarov POMI. Proceedings of Scientific Seminars in St.Petersburg Department of Steklov Institute of Mathematics, Russian Acad. Sci, St.Petersburg. Theory of Complexity of Computations VIII, vol. 304, pp. 19–74 (2003)

    Google Scholar 

  10. Zaslavsky, I.D.: Some criteria of completeness for axiomatic systems in three-valued logic. Transactions of the Institute for Informatics and Automation Problems of National Acad. Sci. Armenia. Mathematical Problems of Computer Science, vol. 27, pp. 174–202 (2006)

    Google Scholar 

  11. Zaslavsky, I.D.: On decidable axiomatic theories in three-valued logic. In: The Batumi Symposium on Logic, Language and Computation, Abstracts of Reports, Batumi (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Balder D. ten Cate Henk W. Zeevat

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zaslavsky, I.D. (2007). Some Criteria of Decidability for Axiomatic Systems in Three-Valued Logic. In: ten Cate, B.D., Zeevat, H.W. (eds) Logic, Language, and Computation. TbiLLC 2005. Lecture Notes in Computer Science(), vol 4363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75144-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75144-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75143-4

  • Online ISBN: 978-3-540-75144-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics