21 search results - page 5 / 5 » Connection-Based Proof Construction in Linear Logic |
97
Voted
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...