Proof Search and Counter Model of Positive Minimal Predicate Logic

DOI10.1016/j.entcs.2008.04.055zbMath1286.03042OpenAlexW2083256368MaRDI QIDQ5415611

Qichao Xuan, Tao Xue

Publication date: 13 May 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.055

zbMATH Keywords

Kripke modelproof searchcounter modelLJB

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (3)

How Hard Is Positive Quantification? ⋮ Intuitionistic games: determinacy, completeness, and normalization ⋮ The existential fragment of second-order propositional intuitionistic logic is undecidable

Cites Work

• Unnamed Item
• Proof-search in type-theoretic languages: An introduction
• Eigenvariables, bracketing and the decidability of positive minimal predicate logic
• Contraction-free sequent calculi for intuitionistic logic
• Interpolation theorems for intuitionistic predicate logic

This page was built for publication: Proof Search and Counter Model of Positive Minimal Predicate Logic