Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic

DOI10.1016/S1571-0661(04)80755-2zbMath1264.03039MaRDI QIDQ4924544

Gilles Dowek, Ying Jiang

Publication date: 6 June 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (1)

Eigenvariables, bracketing and the decidability of positive minimal predicate logic

Cites Work

• Theorem proving modulo
• Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers
• Contraction-free sequent calculi for intuitionistic logic
• Embedding first order predicate logic in fragments of intuitionistic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic