The Sytek theorem prover
Abstract
Recommendations
The Watson Theorem Prover
Watson is a general-purpose system for formal reasoning. It is an interactive equational higher-order theorem prover. The higher-order logic supported by the prover is distinctive in being type free (it is a safe variant of Quine's i>NF). Watson ...
Implementation of Theorem Prover of Relevant Logic
Proceedings of the 28th International Conference on Current Approaches in Applied Artificial Intelligence - Volume 9101The formalization of human deductive reasoning is a main issue in artificial intelligence. Although classical logic is one of the most useful ways for the formalization, the material implication of classical logic has some fallacies. Relevant logic has ...
Theorem Prover for Intuitionistic Logic Based on the Inverse Method
The first-order intuitionistic logic is a formal theory from the family of constructive logics. In intuitionistic logic, it is possible to extract a particular example x = a and a proof of a formula P(a) from a proof of a formula źxP(x). Owing to this ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 107Total Downloads
- Downloads (Last 12 months)44
- Downloads (Last 6 weeks)10
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in