28 search results - page 6 / 6 » Proof search and Co-NP completeness for many-valued logics |
72
Voted
ISCIS
2004
Springer
15 years 3 months ago
2004
Springer
System BV is an extension of multiplicative linear logic with a non-commutative self-dual operator. In this paper we present systems equivalent to system BV where equalities for un...
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
CADE
2004
Springer
15 years 10 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...