Sciweavers

1817 search results - page 2 / 364
» Forcing and Type Theory
Sort
View
JSYML
2007
62views more  JSYML 2007»
13 years 6 months ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras
ENTCS
2008
128views more  ENTCS 2008»
13 years 6 months ago
Towards Formalizing Categorical Models of Type Theory in Type Theory
This note is about work in progress on the topic of "internal type theory" where we investigate the internal formalization of the categorical metatheory of constructive ...
Alexandre Buisse, Peter Dybjer
POPL
2010
ACM
14 years 3 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
13 years 6 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...
BSL
2004
100views more  BSL 2004»
13 years 6 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad