Some examples of different methods of formal proofs with generalizations of the satisfiability definition

Notre Dame Journal of Formal Logic 10 (2):214-224 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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

Some methods of formal proofs. III.Juliusz Reichbach - 1971 - Notre Dame Journal of Formal Logic 12 (4):479-482.
Matrix satisfiability and axiomatization.Robert Ackermann - 1971 - Notre Dame Journal of Formal Logic 12 (3):309-321.
Satisfiability in a larger domain.R. L. Goodstein - 1974 - Notre Dame Journal of Formal Logic 15 (4):598-600.
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.
Trees and finite satisfiability: proof of a conjecture of Burgess.George Boolos - 1984 - Notre Dame Journal of Formal Logic 25 (3):193-197.

Analytics

Added to PP
2010-08-24

Downloads
19 (#1,072,200)

6 months
5 (#1,035,700)

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