LFCS
1992
Springer
13 years 8 months ago
1992
Springer
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operator...
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
d Abstract) Alexander Rabinovich IBM Research Center P.O. Box 218, Yorktown lleights, NY 10598 e.maih alikQtvatson.ibm.com
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...