CADE
14 years 5 months ago
2004 Springer 
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
CADE
14 years 5 months ago
2004 Springer 
Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state a...
CADE
14 years 5 months ago
2004 Springer
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
CADE
13 years 11 months ago
2004 Springer 
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
CADE
13 years 11 months ago
2004 Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
|
Logical Reasoning