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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

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

Deductive completeness.Kosta Došen - 1996 - Bulletin of Symbolic Logic 2 (3):243-283.
Completeness theorems, representation theorems: what's the difference?David C. Makinson - unknown - Hommage À Wlodek: Philosophical Papers Dedicated to Wlodek Rabinowicz, Ed. Rønnow-Rasmussen Et Al. 2007.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
The abstract variable-binding calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.

Analytics

Added to PP
2010-08-24

Downloads
27 (#588,051)

6 months
2 (#1,192,898)

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