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)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093893654

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Some methods of formal proofs. III.Juliusz Reichbach - 1971 - Notre Dame Journal of Formal Logic 12 (4):479-482.
Formal and Empirical Methods in Philosophy of Science.Vincenzo Crupi & Stephan Hartmann - 2009 - In Friedrich Stadler et al (ed.), The Present Situation in the Philosophy of Science. Springer. pp. 87--98.
Lower Bounds for cutting planes proofs with small coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
A Critique of a Formalist-Mechanist Version of the Justification of Arguments in Mathematicians' Proof Practices.Yehuda Rav - 2007 - Philosophia Mathematica 15 (3):291-320.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Toposes in logic and logic in toposes.Marta Bunge - 1984 - Topoi 3 (1):13-22.
Satisfiability in a larger domain.R. L. Goodstein - 1974 - Notre Dame Journal of Formal Logic 15 (4):598-600.
.[author unknown] - unknown
Matrix satisfiability and axiomatization.Robert Ackermann - 1971 - Notre Dame Journal of Formal Logic 12 (3):309-321.

Analytics

Added to PP
2010-08-24

Downloads
10 (#1,155,084)

6 months
3 (#1,002,198)

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