A semi-completeness theorem

Notre Dame Journal of Formal Logic 10 (3):303-308 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

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 Henkin completeness theorem for T.M. J. Cresswell - 1967 - Notre Dame Journal of Formal Logic 8:186.
Post's functional completeness theorem.Francis Jeffry Pelletier & Norman M. Martin - 1990 - Notre Dame Journal of Formal Logic 31 (3):462-475.
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.
An arithmetical completeness theorem for pre-permutations.Friedemann Tuttas - 1992 - Notre Dame Journal of Formal Logic 34 (1):84-89.
A strong completeness theorem for 3-valued logic. Part II.Hugues Leblanc - 1977 - Notre Dame Journal of Formal Logic 18:107.
A proof of a theorem of Ł ukasiewicz.Ivo Thomas - 1971 - Notre Dame Journal of Formal Logic 12 (4):507-508.

Analytics

Added to PP
2010-08-24

Downloads
12 (#317,170)

6 months
2 (#1,816,284)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references