4573 search results - page 265 / 915 » Automated Reasoning |
161
click to vote
CCL
1994
Springer
15 years 10 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
148
click to vote
CSL
1994
Springer
15 years 10 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
222
click to vote
ELP
1993
15 years 10 months ago
1993
The logic of definitional reflection is extended with a theory of free equality. Based on this equality theory a sequent-style notion of the completion of a definition is motivated...
169
click to vote
ELP
1993
15 years 10 months ago
1993
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two...
178
click to vote
ALP
1992
Springer
15 years 10 months ago
1992
Springer
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...