1101 search results - page 45 / 221 » Forcing in proof theory |
136
click to vote
JOOP
1998
15 years 3 months ago
1998
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
152
Voted
TPHOL
2008
IEEE
15 years 9 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
121
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
MLQ
2006
15 years 3 months ago
2006
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
165
click to vote
AAAI
1996
15 years 4 months ago
1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...