Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers

zbMath0208.01101MaRDI QIDQ2543316

Grigori Mints

Publication date: 1968

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Classical first-order logic (03B10) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (8)

How Hard Is Positive Quantification? ⋮ The existential fragment of second-order propositional intuitionistic logic is undecidable ⋮ An intuitionistic formula hierarchy based on high‐school identities ⋮ The eskolemization of universal quantifiers ⋮ Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic ⋮ Decidability of the Class E by Maslov’s Inverse Method ⋮ Eigenvariables, bracketing and the decidability of positive minimal predicate logic ⋮ On the Mints Hierarchy in First-Order Intuitionistic Logic

This page was built for publication: Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers