518 search results - page 2 / 104 » Automating Proofs in Category Theory |
182
Voted
NIL
1991
15 years 3 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
67
Voted
LICS
2003
IEEE
15 years 4 months ago
2003
IEEE
TPHOL
2003
IEEE
15 years 4 months ago
2003
IEEE
109
Voted
CADE
2000
Springer
15 years 4 months ago
2000
Springer
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
81
Voted
TPHOL
1996
IEEE
15 years 3 months ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...