An Intuitionistic Predicate Logic Theorem Prover
نویسندگان
چکیده
منابع مشابه
Ileantap: an Intuitionistic Theorem Prover Ileantap: an Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for rst-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string uniica-tion to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the diierent logical connectives the implementation can easily be adapted to deal with other n...
متن کاملAn Automated Theorem Prover for Intuitionistic Predicate Logic Based on Dialogue Games
1 Dialogue Logic In Dialogue Logic the validity of some given formula F is examined in two person, perfect information games. There are two players moving alternatively, both having complete information of the current situation of the game. The player who claims being able to justify F is called the proponent, his adversary the opponent. The initial state, the dialogue setting, is determined by...
متن کاملColosseum An Automated Theorem Prover for Intuitionistic Predicate Logic based on Dialogue Games
Game theory can be a basis for theorem proving. In Dialogue Logic the validity of a formula F is examined in two person, perfect information games. After a brief description of Dialogue Logic and introductionary examples we discuss some implementation issues of Colosseum, our theorem prover implementing Dialogue Games. We describe the search space one has to conquer and propose search tactics t...
متن کاملileanTAP: An Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string unification to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the different logical connectives the implementation can easily be adapted to deal with othe...
متن کاملA Sequent Based Theorem Prover for Propositional Intuitionistic Logic
We describe a theorem prover based on a new sequent calculus for Intuitionistic Propositional Logic. We discuss the effects of various optimisations, and analyse its performance compared to current state of the art theorem provers. We find that the prover produces competitive results on many classes of formulae.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1992
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/2.5.619