Henkin style completeness proofs in theories lacking negation

Notre Dame Journal of Formal Logic 12 (4):509-511 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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 Henkin-style completeness proof for the pure implicational calculus.George F. Schumm - 1975 - Notre Dame Journal of Formal Logic 16 (3):402-404.
A Henkin completeness theorem for T.M. J. Cresswell - 1967 - Notre Dame Journal of Formal Logic 8:186.
On the proofs of arithmetical completeness for interpretability logic.Domenico Zambella - 1992 - Notre Dame Journal of Formal Logic 33 (4):542-551.
Some proofs of relative completeness in modal logic.M. J. Cresswell - 1968 - Notre Dame Journal of Formal Logic 9 (1):62-66.
Quick completeness proofs for some logics of conditionals.John P. Burgess - 1981 - Notre Dame Journal of Formal Logic 22 (1):76-84.
Completeness of relevant quantification theories.Robert K. Meyer, J. Michael Dunn & Hugues Leblanc - 1974 - Notre Dame Journal of Formal Logic 15 (1):97-121.

Analytics

Added to PP
2010-08-24

Downloads
9 (#1,268,194)

6 months
6 (#701,126)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John Pollock
University of Edinburgh

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references