On the Existence of Finite Models and Decision Procedures for Propositional Calculi

Journal of Symbolic Logic 25 (2):180-181 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964251

Links

PhilArchive



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

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

Review: R. Harrop, On the Existence of Finite Models and Decision Procedures for Propositional Calculi. [REVIEW]H. Arnold Schmidt - 1960 - Journal of Symbolic Logic 25 (2):180-181.
Review: R. Harrop, H. Arnold Schmidt, K. Schutte, H.-J. Thiele, Some Forms of Models of Propositional Calculi; Ronald Harrop, On the Equivalence for Non-Derivability Testing of Finite Smiley Models and Finite Modified Smiley Models. [REVIEW]Dolph Ulrich - 1975 - Journal of Symbolic Logic 40 (2):251-251.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Sequent calculi and decision procedures for weak modal systems.René Lavendhomme & Thierry Lucas - 2000 - Studia Logica 66 (1):121-145.
Some results concerning finite model separability of propositional calculi.Ronald Harrop - 1976 - Studia Logica 35 (2):179 - 189.
Some Forms of Models of Propositional Calculi.R. Harrop, H. Arnold Schmidt, K. Schutte & Ronald Harrop - 1975 - Journal of Symbolic Logic 40 (2):251-251.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Decision procedures and model building in equational clause logic.C. Fermuller & A. Leitsch - 1998 - Logic Journal of the IGPL 6 (1):17-41.
Decision procedures for some strong hybrid logics.Andrzej Indrzejczak & Michał Zawidzki - 2013 - Logic and Logical Philosophy 22 (4):389-409.
Completeness theorem for propositional probabilistic models whose measures have only finite ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
A Note on the Existence of Tautologies in Certain Propositional Calculi Without Propositional Variables.Alan Rose - 1976 - Mathematical Logic Quarterly 22 (1):117-118.
On Minimal Models for Pure Calculi of Names.Piotr Kulicki - 2013 - Logic and Logical Philosophy 22 (4):429–443.
Algebraiczna semantyka dla nihilistycznych rachunków zdań.Eugeniusz Żabski - 1993 - Filozofia Nauki 4.
Some properties of strongly finite propositional calculi.Ryszard Wojcicki - 1972 - Bulletin of the Section of Logic 1 (1):69-71.
A note on finite axiomatization of partial propositional calculi.W. E. Singletary - 1967 - Journal of Symbolic Logic 32 (3):352-354.

Analytics

Added to PP
2015-02-05

Downloads
3 (#1,706,939)

6 months
2 (#1,187,206)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
Proof Theory and Algebra in Logic.Hiroakira Ono - 2019 - Singapore: Springer Singapore.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references