Sciweavers

1101 search results - page 3 / 221
» Forcing in proof theory
Sort
View
CSL
2009
Springer
14 years 28 days ago
Forcing and Type Theory
Thierry Coquand
JSYML
2008
72views more  JSYML 2008»
13 years 6 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
JSYML
2006
97views more  JSYML 2006»
13 years 6 months ago
The proper forcing axiom and the singular cardinal hypothesis
We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof uses the reflection principle MRP introduced by Moore in [11].
Matteo Viale
NIL
1991
13 years 10 months ago
Normal Form Results for Default Logic
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.
V. Wiktor Marek, Miroslaw Truszczynski
SOSL
1993
13 years 10 months ago
Verifying Process Algebra Proofs in Type Theory
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
M. P. A. Sellink