Undecidability of the General Problems of Completeness, Decidability and Equivalence for Propositional Calculi

&
Journal of Symbolic Logic 37 (4):756-757 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272438

Links

PhilArchive



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

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

Decidability of structural completeness for strongly finite propositional calculi.Zdzis law Dywan - 1978 - Bulletin of the Section of Logic 7 (3):129-131.
Decidability of structural completeness for strongly finite propositional calculi.Zdzislaw Dywan - 1978 - Bulletin of the Section of Logic 7 (3):129-131.
Hypersequent calculi for intuitionistic logic with classical atoms.Hidenori Kurokawa - 2010 - Annals of Pure and Applied Logic 161 (3):427-446.
Probabilization of Logics: Completeness and Decidability. [REVIEW]Pedro Baltazar - 2013 - Logica Universalis 7 (4):403-440.
Decidability of an Xstit Logic.Gillman Payette - 2014 - Studia Logica 102 (3):577-607.
Completeness and decidability of tense logics closely related to logics above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
Transfer Principles in Set Theory.Harvey M. Friedman - unknown
The decidability of one-variable propositional calculi.M. D. Gladstone - 1979 - Notre Dame Journal of Formal Logic 20 (2):438-450.
Roman Murawski, recursive functions and metamathematics: Problems of completeness and decidability.E. Mendelson - 2000 - Philosophia Mathematica 8 (3):345-346.
An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
Complexity of interpolation and related problems in positive calculi.Larisa Maksimova - 2002 - Journal of Symbolic Logic 67 (1):397-408.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Completeness before Post: Bernays, Hilbert, and the development of propositional logic.Richard Zach - 1999 - Bulletin of Symbolic Logic 5 (3):331-366.
Decidability op stbdctural completeness fob strongly finite pbopositional calculi.Zdzislaw Dyaan - 1980 - In Jacek K. Kabziński (ed.), Proceedings of the 24-th Conference on the History of Logic, Cracow, April 28-30, 1978. Cracow: Jagiellonian University Press. pp. 147--16.

Analytics

Added to PP
2015-02-05

Downloads
6 (#1,430,516)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references