2649 search results - page 264 / 530 » Temporal Theories of Reasoning |
144
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
129
click to vote
LICS
1999
IEEE
15 years 9 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
158
click to vote
LACL
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
130
Voted
CADE
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. We present a technique that efficiently translates propositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary...
131
click to vote
LICS
1994
IEEE
15 years 9 months ago
1994
IEEE
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...