1101 search results - page 5 / 221 » Forcing in proof theory |
JAR
2007
13 years 7 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
TPHOL
1996
IEEE
13 years 11 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...
AML
2007
13 years 7 months ago
2007
We provide an exposition of supercompact Radin forcing and present several methods for iterating Radin forcing. In this paper we give an exposition of supercompact Radin forcing us...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see