Sciweavers

1101 search results - page 12 / 221
» Forcing in proof theory
Sort
View
ENTCS
1998
63views more  ENTCS 1998»
13 years 7 months ago
Proof theory and computational analysis
Ulrich Kohlenbach
ENTCS
2008
94views more  ENTCS 2008»
13 years 6 months ago
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper...
Gilles Dowek
CORR
2011
Springer
170views Education» more  CORR 2011»
12 years 11 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano
LICS
2012
IEEE
11 years 10 months ago
The Complete Proof Theory of Hybrid Systems
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
André Platzer
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
14 years 1 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
Adrian Craciun, Madalina Hodorog