Every functionally complete $m$-valued logic has a Post-complete axiomatization

Notre Dame Journal of Formal Logic 11 (1):106-106 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,518

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Binary closure-algebraic operations that are functionally complete.Gerald J. Massey - 1970 - Notre Dame Journal of Formal Logic 11 (3):340-342.
A complete classification of three-place functors in two-valued logic.J. C. Muzio - 1976 - Notre Dame Journal of Formal Logic 17 (3):429-437.
Definability of Boolean Functions in Kripke Semantics.Naosuke Matsuda - 2023 - Notre Dame Journal of Formal Logic 64 (3):363-376.
Some Post-complete extensions of S2 and S3.Robert V. Kohn - 1977 - Notre Dame Journal of Formal Logic 18:467.

Analytics

Added to PP
2010-08-24

Downloads
24 (#921,712)

6 months
9 (#519,282)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Storrs McCall
McGill University
Nuel Belnap
University of Pittsburgh

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references