A strong completeness theorem for $3$-valued logic [Book Review]

Notre Dame Journal of Formal Logic 15 (2):325-330 (1974)
  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 strong completeness theorem for 3-valued logic. Part II.Hugues Leblanc - 1977 - Notre Dame Journal of Formal Logic 18:107.
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.
On Yablonskii theory concerning functional completeness of $k$-valued logic.Kanzo Hino - 1977 - Notre Dame Journal of Formal Logic 18 (2):251-254.
Post's functional completeness theorem.Francis Jeffry Pelletier & Norman M. Martin - 1990 - Notre Dame Journal of Formal Logic 31 (3):462-475.

Analytics

Added to PP
2010-08-24

Downloads
27 (#142,020)

6 months
13 (#1,035,185)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Hybridized Paracomplete and Paraconsistent Logics.Colin Caret - 2017 - Australasian Journal of Logic 14 (1):281-325.
Many-Valued Logics and Bivalent Modalities.Edson Bezerra & Giorgio Venturi - forthcoming - Logic and Logical Philosophy:1-26.

Add more citations

References found in this work

No references found.

Add more references