A strong completeness theorem for 3-valued logic. Part II

Notre Dame Journal of Formal Logic 18:107 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
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.
Strong completeness of lattice-valued logic.Mitio Takano - 2002 - Archive for Mathematical Logic 41 (5):497-505.
Well‐Defined Fuzzy Sentential Logic.Esko Turunen - 1995 - Mathematical Logic Quarterly 41 (2):236-248.
Algebras of intervals and a logic of conditional assertions.Peter Milne - 2004 - Journal of Philosophical Logic 33 (5):497-548.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.

Analytics

Added to PP
2010-08-24

Downloads
36 (#421,132)

6 months
2 (#1,157,335)

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