Semantic tableaux as a framework for automated theorem-proving
on Advances in artificial intelligence
Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
ileanTAP: An Intuitionistic Theorem Prover
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Connection Based Proof Method for Intuitionistic Logic
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Uniform Proof Procedure for Classical and Non-Classical Logics
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Proof Search in the Intuitionistic Sequent Calculus
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
leanCoP: lean connection-based theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Sequent forms of Herbrand theorem and their applications
Annals of Mathematics and Artificial Intelligence
Evidence algorithm and system for automated deduction: a retrospective view
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
| Hi-index | 0.00 |
In this paper we reduce the question of validity of a first-order intuitionistic formula without equality to generating ground instances of this formula and then checking whether the instances are deducible in a propositional intuitionistic tableaux calculus, provided that the propositional proof is compatible with the way how the instances were generated. This result can be seen as a form of the Herbrand theorem, and so it provides grounds for further theoretical investigation of computer-oriented intuitionistic calculi.