Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication

Logic Journal of the IGPL 23 (2):341-353 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzu047

Links

PhilArchive



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

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

Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Sequent Calculi for Some Strict Implication Logics.Ryo Ishigaki & Ryo Kashima - 2008 - Logic Journal of the IGPL 16 (2):155-174.
Undecidability of the General Problems of Completeness, Decidability and Equivalence for Propositional Calculi.A. V. Kuznecov & E. Mendelson - 1972 - Journal of Symbolic Logic 37 (4):756-757.
On the number of variables in undecidable superintuitionistic propositional calculi.Grigoriy V. Bokov - 2016 - Logic Journal of the IGPL 24 (5).
Review: G. S. Cejtin, Concerning the Problem of Recognizing Properties of Associative Calculi. [REVIEW]Andrzej Mostowski - 1957 - Journal of Symbolic Logic 22 (2):219-220.
Kuznecov A. V.. Undecidability of the general problems of completeness, decidability and equivalence for propositional calculi. English translation of XXXVII 772 by E. Mendelson. American Mathematical Society translations, ser. 2 vol. 59 , pp. 56–72. [REVIEW]Ann Yasuhara - 1972 - Journal of Symbolic Logic 37 (4):756-757.
Unification with parameters in the implication fragment of classical propositional logic.Philippe Balbiani & Mojtaba Mojtahedi - 2022 - Logic Journal of the IGPL 30 (3):454-464.
Recursive models for three-valued propositional calculi with classical implication.Vladeta Vučković - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):148-153.
Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics.A. Avellone, M. Ferrari & P. Miglioli - 1999 - Logic Journal of the IGPL 7 (4):447-480.
Review: V. A. Jankov, Conjunctively Indecomposable Formulas in Propositional Calculi. [REVIEW]C. G. McKay - 1972 - Journal of Symbolic Logic 37 (1):186-186.

Analytics

Added to PP
2016-06-30

Downloads
15 (#244,896)

6 months
7 (#1,397,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references