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

DOI10.1093/jigpal/jzu047zbMath1405.03030arXiv1407.7010OpenAlexW3099382357MaRDI QIDQ4644516

G. V. Bokov

Publication date: 8 January 2019

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7010

zbMATH Keywords

finite axiomatizationimplicational calculustag systemclassical and intuitionistic propositional calculi

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Classical propositional logic (03B05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

Undecidable iterative propositional calculus ⋮ Unnamed Item

This page was built for publication: Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication