116
click to vote
CADE
16 years 16 days 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...
95
Voted
CADE
16 years 16 days ago
2004 Springer 
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
126
Voted
AIML
15 years 1 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
103
click to vote
CADE
16 years 16 days ago
2004 Springer 
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
109
click to vote
CADE
16 years 16 days ago
2004 Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
|
Logical Reasoning