Post's functional completeness theorem

Notre Dame Journal of Formal Logic 31 (3):462-475 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Similar books and articles

Counting functions.Fred Johnson - 1992 - Notre Dame Journal of Formal Logic 33 (4):567-568.
A completeness theorem for dynamic logic.László Csirmaz - 1985 - Notre Dame Journal of Formal Logic 26 (1):51-60.
A semi-completeness theorem.Stephen L. Bloom - 1969 - Notre Dame Journal of Formal Logic 10 (3):303-308.
A rule-completeness theorem.Nuel D. Belnap & Richmond H. Thomason - 1963 - Notre Dame Journal of Formal Logic 4 (1):39-43.
A Henkin completeness theorem for T.M. J. Cresswell - 1967 - Notre Dame Journal of Formal Logic 8:186.
A strong completeness theorem for $3$-valued logic. [REVIEW]H. Goldberg, H. Leblanc & G. Weaver - 1974 - Notre Dame Journal of Formal Logic 15 (2):325-330.
Definability of Boolean Functions in Kripke Semantics.Naosuke Matsuda - 2023 - Notre Dame Journal of Formal Logic 64 (3):363-376.

Analytics

Added to PP
2010-08-24

Downloads
132 (#338,486)

6 months
25 (#406,246)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Trivalence: Origins and Developments.Paul Egré & Lorenzo Rossi - forthcoming - In Paul Egre & Lorenzo Rossi, Handbook of Three-Valued Logic. Cambridge, Massachusetts: The MIT Press.
Counting functions.Fred Johnson - 1992 - Notre Dame Journal of Formal Logic 33 (4):567-568.
Representing voting rules in Łukasiewicz’s three-valued logic.Adrian Miroiu & Mircea Dumitru - 2022 - Journal of Applied Non-Classical Logics 32 (1):72-88.
Definability of Boolean Functions in Kripke Semantics.Naosuke Matsuda - 2023 - Notre Dame Journal of Formal Logic 64 (3):363-376.

View all 6 citations / Add more citations

References found in this work

The two-valued iterative systems of mathematical logic.Emil Leon Post - 1941 - London,: H. Milford, Oxford university press.

Add more references