909 research outputs found
Perspectives for proof unwinding by programming languages techniques
In this chapter, we propose some future directions of work, potentially
beneficial to Mathematics and its foundations, based on the recent import of
methodology from the theory of programming languages into proof theory. This
scientific essay, written for the audience of proof theorists as well as the
working mathematician, is not a survey of the field, but rather a personal view
of the author who hopes that it may inspire future and fellow researchers
An interpretation of the Sigma-2 fragment of classical Analysis in System T
We show that it is possible to define a realizability interpretation for the
-fragment of classical Analysis using G\"odel's System T only. This
supplements a previous result of Schwichtenberg regarding bar recursion at
types 0 and 1 by showing how to avoid using bar recursion altogether. Our
result is proved via a conservative extension of System T with an operator for
composable continuations from the theory of programming languages due to Danvy
and Filinski. The fragment of Analysis is therefore essentially constructive,
even in presence of the full Axiom of Choice schema: Weak Church's Rule holds
of it in spite of the fact that it is strong enough to refute the formal
arithmetical version of Church's Thesis
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
We apply to the semantics of Arithmetic the idea of ``finite approximation''
used to provide computational interpretations of Herbrand's Theorem, and we
interpret classical proofs as constructive proofs (with constructive rules for
) over a suitable structure \StructureN for the language of
natural numbers and maps of G\"odel's system \SystemT. We introduce a new
Realizability semantics we call ``Interactive learning-based Realizability'',
for Heyting Arithmetic plus \EM_1 (Excluded middle axiom restricted to
formulas). Individuals of \StructureN evolve with time, and
realizers may ``interact'' with them, by influencing their evolution. We build
our semantics over Avigad's fixed point result, but the same semantics may be
defined over different constructive interpretations of classical arithmetic
(Berardi and de' Liguoro use continuations). Our notion of realizability
extends intuitionistic realizability and differs from it only in the atomic
case: we interpret atomic realizers as ``learning agents''
Arithmetical conservation results
In this paper we present a proof of Goodman's Theorem, a classical result in
the metamathematics of constructivism, which states that the addition of the
axiom of choice to Heyting arithmetic in finite types does not increase the
collection of provable arithmetical sentences. Our proof relies on several
ideas from earlier proofs by other authors, but adds some new ones as well. In
particular, we show how a recent paper by Jaap van Oosten can be used to
simplify a key step in the proof. We have also included an interesting
corollary for classical systems pointed out to us by Ulrich Kohlenbach
Reverse mathematics and uniformity in proofs without excluded middle
We show that when certain statements are provable in subsystems of
constructive analysis using intuitionistic predicate calculus, related
sequential statements are provable in weak classical subsystems. In particular,
if a sentence of a certain form is provable using E-HA
along with the axiom of choice and an independence of premise principle, the
sequential form of the statement is provable in the classical system RCA. We
obtain this and similar results using applications of modified realizability
and the \textit{Dialectica} interpretation. These results allow us to use
techniques of classical reverse mathematics to demonstrate the unprovability of
several mathematical principles in subsystems of constructive analysis.Comment: Accepted, Notre Dame Journal of Formal Logi
A functional interpretation for nonstandard arithmetic
We introduce constructive and classical systems for nonstandard arithmetic
and show how variants of the functional interpretations due to Goedel and
Shoenfield can be used to rewrite proofs performed in these systems into
standard ones. These functional interpretations show in particular that our
nonstandard systems are conservative extensions of extensional Heyting and
Peano arithmetic in all finite types, strengthening earlier results by
Moerdijk, Palmgren, Avigad and Helzner. We will also indicate how our rewriting
algorithm can be used for term extraction purposes. To conclude the paper, we
will point out some open problems and directions for future research and
mention some initial results on saturation principles
From coinductive proofs to exact real arithmetic: theory and applications
Based on a new coinductive characterization of continuous functions we
extract certified programs for exact real number computation from constructive
proofs. The extracted programs construct and combine exact real number
algorithms with respect to the binary signed digit representation of real
numbers. The data type corresponding to the coinductive definition of
continuous functions consists of finitely branching non-wellfounded trees
describing when the algorithm writes and reads digits. We discuss several
examples including the extraction of programs for polynomials up to degree two
and the definite integral of continuous maps
CZF does not have the Existence Property
Constructive theories usually have interesting metamathematical properties
where explicit witnesses can be extracted from proofs of existential sentences.
For relational theories, probably the most natural of these is the existence
property, EP, sometimes referred to as the set existence property. This states
that whenever (\exists x)\phi(x) is provable, there is a formula \chi(x) such
that (\exists ! x)\phi(x) \wedge \chi(x) is provable. It has been known since
the 80's that EP holds for some intuitionistic set theories and yet fails for
IZF. Despite this, it has remained open until now whether EP holds for the most
well known constructive set theory, CZF. In this paper we show that EP fails
for CZF
- …