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)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093635508

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

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

Through your library

My notes

Similar books and articles

Independent necessary conditions for functional completeness in $m$-valued logic.Yale N. Patt - 1977 - Notre Dame Journal of Formal Logic 18 (2):318-320.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
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 rule-completeness theorem.Nuel D. Belnap & Richmond H. Thomason - 1963 - Notre Dame Journal of Formal Logic 4 (1):39-43.
A semi-completeness theorem.Stephen L. Bloom - 1969 - Notre Dame Journal of Formal Logic 10 (3):303-308.
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.Stephen L. Bloom - 1973 - Notre Dame Journal of Formal Logic 14 (3):408-410.
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.
A Henkin completeness theorem for T.M. J. Cresswell - 1967 - Notre Dame Journal of Formal Logic 8:186.
An arithmetical completeness theorem for pre-permutations.Friedemann Tuttas - 1992 - Notre Dame Journal of Formal Logic 34 (1):84-89.

Analytics

Added to PP
2010-08-24

Downloads
27 (#577,964)

6 months
2 (#1,448,208)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Definability of Boolean Functions in Kripke Semantics.Naosuke Matsuda - 2023 - Notre Dame Journal of Formal Logic 64 (3):363-376.
Counting functions.Fred Johnson - 1992 - Notre Dame Journal of Formal Logic 33 (4):567-568.

Add more citations

References found in this work

No references found.

Add more references