32 search results - page 4 / 7 » Herbrand's theorem and term induction |
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
HICSS
1994
IEEE
13 years 11 months ago
1994
IEEE
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...