Decidability problems for the prenex fragment of intuitionistic logic
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 503-512
- https://doi.org/10.1109/lics.1996.561467
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Proof search in first-order linear logic and other cut-free sequent calculiPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The undecidability of simultaneous rigid E-unificationTheoretical Computer Science, 1996
- Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unificationPublished by Springer Nature ,1996
- Proof-search in intuitionistic logic based on constraint satisfactionPublished by Springer Nature ,1996
- An O(n log n)-Space Decision Procedure for Intuitionistic Propositional LogicJournal of Logic and Computation, 1993
- Theorem proving using equational matings and rigid E -unificationJournal of the ACM, 1992
- Rigid E-unification: NP-completeness and applications to equational matingsInformation and Computation, 1990
- First-order modal tableauxJournal of Automated Reasoning, 1988
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979
- The Diophantine problem for addition and divisibilityTransactions of the American Mathematical Society, 1978