Sciweavers

1888 search results - page 5 / 378
» Proof theory and computational analysis
Sort
View
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
13 years 6 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
MOC
1998
104views more  MOC 1998»
13 years 6 months ago
Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...
Konstantin Mischaikow, Marian Mrozek
CIE
2010
Springer
13 years 11 months ago
The Peirce Translation and the Double Negation Shift
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
Martín Hötzel Escardó, Paulo Ol...
BSL
2007
53views more  BSL 2007»
13 years 6 months ago
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
We introduce a nonstandard arithmetic NQA− based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA+ ), with a weakened external open minimizati...
Michal Rössler, Emil Jerábek