438 search results - page 54 / 88 » On theorem proving in annotated logics |
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
ESSLLI
1999
Springer
15 years 2 months ago
1999
Springer
In this paper I take a dynamic view in the spirit of the update semantics by Veltman (1996) on the first–order model construction procedure presented by Manthey and Bry (1988)....