Results 1  10
of
15
Dependent choices, ‘quote’ and the clock
 Th. Comp. Sc
, 2003
"... When using the CurryHoward correspondence in order to obtain executable programs from mathematical proofs, we are faced with a difficult problem: to interpret each axiom of our axiom system for mathematics (which may be, for example, second order classical logic, or classical set theory) as an inst ..."
Abstract

Cited by 28 (10 self)
 Add to MetaCart
When using the CurryHoward correspondence in order to obtain executable programs from mathematical proofs, we are faced with a difficult problem: to interpret each axiom of our axiom system for mathematics (which may be, for example, second order classical logic, or classical set theory) as an instruction of our programming language. This problem
Foundational and mathematical uses of higher types
 REFLECTIONS ON THE FOUNDATIONS OF MATHEMATICS: ESSAY IN HONOR OF SOLOMON FEFERMAN
, 1999
"... In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are prooftheoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on noncollapsing hierarchies ( n WKL+ ; n WKL+ ) of principles ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are prooftheoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on noncollapsing hierarchies ( n WKL+ ; n WKL+ ) of principles which generalize (and for n = 0 coincide with) the socalled `weak' König's lemma WKL (which has been studied extensively in the context of second order arithmetic) to logically more complex tree predicates. Whereas the second order context used in the program of reverse mathematics requires an encoding of higher analytical concepts like continuous functions F : X ! Y between Polish spaces X;Y , the more exible language of our systems allows to treat such objects directly. This is of relevance as the encoding of F used in reverse mathematics tacitly yields a constructively enriched notion of continuous functions which e.g. for F : IN ! IN can be seen (in our higher order context)
On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness
 PURE AND APPLIED LOGIC
, 1997
"... In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T n in all finite types which are suited to formalize substantial parts of analysis but ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T n in all finite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive function(al)s of low growth. We reduce the use of instances of these principles in T n proofs of a large class of formulas to the use of instances of certain arithmetical principles thereby determining faithfully the arithmetical content of the former. This is achieved using the method of elimination of Skolem functions for monotone formulas which was introduced by the author in a previous paper. As
Proof Interpretations and the Computational Content of Proofs. Draft of book in preparation
, 2007
"... This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question
On the Computational Content of the BolzanoWeierstraß Principle
, 2009
"... We will apply the methods developed in the field of ‘proof mining’ to the BolzanoWeierstraß theorem BW and calibrate the computational contribution of using this theorem in proofs of combinatorial statements. We provide an explicit solution of the Gödel functional interpretation (combined with nega ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We will apply the methods developed in the field of ‘proof mining’ to the BolzanoWeierstraß theorem BW and calibrate the computational contribution of using this theorem in proofs of combinatorial statements. We provide an explicit solution of the Gödel functional interpretation (combined with negative translation) as well as the monotone functional interpretation of BW for the product space ∏i∈N[−k i, k i] (with the standard product metric). This results in optimal program and bound extraction theorems for proofs based on fixed instances of BW, i.e. for BW applied to fixed sequences in ∏i∈N[−k i, k i].
Gödels reformulation of Gentzen’s first consistency proof for arithmetic: the nocounterexample interpretation
 The. Bulletin of Symbolic Logic
, 2005
"... Abstract. The last section of “Lecture at Zilsel’s ” [9, §4] contains an interesting but quite condensed discussion of Gentzen’s first version of his consistency proof for P A [8], reformulating it as what has come to be called the nocounterexample interpretation. I will describe Gentzen’s result ( ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The last section of “Lecture at Zilsel’s ” [9, §4] contains an interesting but quite condensed discussion of Gentzen’s first version of his consistency proof for P A [8], reformulating it as what has come to be called the nocounterexample interpretation. I will describe Gentzen’s result (in gametheoretic terms), fill in the details (with some corrections) of Gödel’s reformulation, and discuss the relation between the two proofs. 1. Let me begin with a description of Gentzen’s consistency proof. As had already been noted in [5], we may express it in terms of a game. 1 To simplify things, we can assume that the logical constants of the classical system of number theory, P A, are ∧, ∨, ∀ and ∃ and that negations are applied only to atomic formulas. ¬φ in general is represented by the complement φ of φ, obtained by interchanging ∧ with ∨, ∀ with ∃, and atomic sentences with their negations. The components of the sentences φ ∨ ψ and φ ∧ ψ are φ and ψ. The components of the sentences ∃xφ(x) and ∀xφ(x) are the sentences φ(¯n) for each numeral ¯n. A ∧ or ∀sentence, called a �sentence, is thus expressed by the conjunction of its components and a ∨ or ∃sentence, called a �sentence, is expressed by the disjunction of them; and so it follows that every sentence can be represented as an infinitary propositional formula built up from prime sentences— atomic or negated atomic sentences. Disjunctive and conjunctive sentences with the components φn (where the range of n is 1, 2 or ω) will be denoted respectively by
The πCalculus: Notes on Labelled Semantics
 Bulletin of the EATCS
, 1998
"... ). In A. Tarlecki, editor, Proc. 16th International Symp. on Mathematical Foundations of Computer Science, MFCS '91, volume 520 of LNCS. SpringerVerlag, 1991. [BCHK93] G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Theoretical Computer Science, 114(1):3161, 1993. Full v ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
). In A. Tarlecki, editor, Proc. 16th International Symp. on Mathematical Foundations of Computer Science, MFCS '91, volume 520 of LNCS. SpringerVerlag, 1991. [BCHK93] G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Theoretical Computer Science, 114(1):3161, 1993. Full version of [BCHK91]. [BHR84] S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A Theory of Communicating Sequential Processes. Journal of the ACM, 31(3):560599, 1984. [BK84] J.A. Bergstra and J.W. Klop. Process Algebra for Synchronous Communication. Information and Control, 60:109137, 1984. 12 REFERENCES [BK85] J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77{ 121, 1985. [BS94] M. Boreale and D. Sangiorgi. A fully abstract semantics for causality in the picalculus. Report ECSLFCS94297, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1994. An extract appeared in the ...