154 search results - page 8 / 31 » Proof Complexity of Non-classical Logics |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
CADE
1992
Springer
14 years 18 days ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
CADE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
LPAR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...