Skip to main content
SpringerLink
Log in

A game-based formal system for Ł∞

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

A formal system for Ł∞, based on a “game-theoretic” analysis of the Łukasiewicz prepositional connectives, is defined and proved to be complete. An “Herbrand theorem” for the Ł∞ predicate calculus (a variant of some work of Mostowski) and some corollaries relating to its axiomatizability are proved. The predicate calculus with equality is also considered.

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

  1. C. C. Chang, and H. J., Keisler, Continuous Model Theory, Annals of Mathematics Studies 58, Princeton University Press, Princeton, N. J., 1966.

    Google Scholar 

  2. E. Giles, A Nonclassical Logic for Physics, in: Selected Papers on Łukasiewicz Sentential Calculi, Ossolineum Warsaw, 1977, pp. 13–51. (A shortened version can be found in Studia Logica, 33, pp. 397–415).

    Google Scholar 

  3. R. Giles, Łukasiewicz Logic and Fuzzy Set Theory, J. Man-Machine Studies 8, pp. 313–327.

  4. J. Łukasiewicz, and A. Tarski, Untersuchungen über den Aussagenkalkul, Comptes Rendus des Séances de la Société des Sciences et Lettres de Varsovie, Classe III, 23, (1930), pp. 30–50.

    Google Scholar 

  5. E. McNaughton, A Theorem about Infinite-Valued Sentential Logic, Journal of Symbolic Logic 16, pp. 1–13.

  6. A. Mostowski, Axiomatizability of Some Many-Valued Calculi, Fundamenta Mathematicae L., pp. 165–190.

  7. A. Mostowski, The Hubert Epsilon Function in Many-Valued Logics, in: Proceedings of a Colloquium on Model and Many-Valued Logics, Acta Philosophica Fennica Fasc. XVI (1963), pp. 169–188.

  8. A. Rose, and J. B. Rosser, Fragments of Many-Valued Statement Calculi, Transactions of the American Mathematical Society 87, pp. 1–53.

  9. B. Scarpellini, Die Nichtaxiomatisierbarkeit des unendlich Pradikatemkalkeils von Łukasiewicz. Journal of Symbolic Logic 27, pp. 159–170.

  10. D. Scott, Completeness and Axiomatisability in Many-Valued Logic, in: Henkin et al., eds., Proceedings of the Tarski Symposium, A. M. S. Proceedings of Symposia in Pure Mathematics, v. XXV, A. M. S. Providence, R. I. 1974, pp. 411–435.

    Google Scholar 

  11. M. Wajsberg, Beitrage zum Metaaussagenkalkul I, Monatshefte für Mathematik und Physik 42 (1935), pp. 221–242.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queen's University Kingston, Canada

    Alan Adamson & Robin Giles

  2. Mathematical Institute, Oxford

    Alan Adamson & Robin Giles

Authors
  1. Alan Adamson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robin Giles
    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

Adamson, A., Giles, R. A game-based formal system for Ł∞ . Stud Logica 38, 49–73 (1979). https://doi.org/10.1007/BF00493672

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation