Sciweavers

3 search results - page 1 / 1
» Skolem Functions and Equality in Automated Deduction
Sort
View
88
Voted
AAAI
1990
14 years 11 months ago
Skolem Functions and Equality in Automated Deduction
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 ...
William McCune
68
Voted
TPHOL
2006
IEEE
15 years 4 months ago
Minlog
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of G¨odel’s T of type (N→N)→(N→N). The gen...
Helmut Schwichtenberg
117
Voted
MCMASTER
1993
15 years 2 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz