446 search results - page 31 / 90 » Automating Theories in Intuitionistic Logic |
98
Voted
AAAI
1990
15 years 1 months ago
1990
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
83
Voted
MLQ
2007
15 years 1 days ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
123
Voted
CADE
1992
Springer
15 years 4 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
83
Voted
TPHOL
1997
IEEE
15 years 4 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
123
click to vote
JSC
2000
15 years 9 days ago
2000
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...