16,519 research outputs found
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators
First, we reconstruct Wim Veldman's result that Open Induction on Cantor
space can be derived from Double-negation Shift and Markov's Principle. In
doing this, we notice that one has to use a countable choice axiom in the proof
and that Markov's Principle is replaceable by slightly strengthening the
Double-negation Shift schema. We show that this strengthened version of
Double-negation Shift can nonetheless be derived in a constructive intermediate
logic based on delimited control operators, extended with axioms for
higher-type Heyting Arithmetic. We formalize the argument and thus obtain a
proof term that directly derives Open Induction on Cantor space by the shift
and reset delimited control operators of Danvy and Filinski
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
On streams that are finitely red
Mixing induction and coinduction, we study alternative definitions of streams
being finitely red. We organize our definitions into a hierarchy including also
some well-known alternatives in intuitionistic analysis. The hierarchy
collapses classically, but is intuitionistically of strictly decreasing
strength. We characterize the differences in strength in a precise way by weak
instances of the Law of Excluded Middle
A proof of strong normalisation using domain theory
Ulrich Berger presented a powerful proof of strong normalisation using
domains, in particular it simplifies significantly Tait's proof of strong
normalisation of Spector's bar recursion. The main contribution of this paper
is to show that, using ideas from intersection types and Martin-Lof's domain
interpretation of type theory one can in turn simplify further U. Berger's
argument. We build a domain model for an untyped programming language where U.
Berger has an interpretation only for typed terms or alternatively has an
interpretation for untyped terms but need an extra condition to deduce strong
normalisation. As a main application, we show that Martin-L\"{o}f dependent
type theory extended with a program for Spector double negation shift.Comment: 16 page
On Various Negative Translations
Several proof translations of classical mathematics into intuitionistic
mathematics have been proposed in the literature over the past century. These
are normally referred to as negative translations or double-negation
translations. Among those, the most commonly cited are translations due to
Kolmogorov, Godel, Gentzen, Kuroda and Krivine (in chronological order). In
this paper we propose a framework for explaining how these different
translations are related to each other. More precisely, we define a notion of a
(modular) simplification starting from Kolmogorov translation, which leads to a
partial order between different negative translations. In this derived
ordering, Kuroda and Krivine are minimal elements. Two new minimal translations
are introduced, with Godel and Gentzen translations sitting in between
Kolmogorov and one of these new translations.Comment: In Proceedings CL&C 2010, arXiv:1101.520
A Galois connection between classical and intuitionistic logics. II: Semantics
Three classes of models of QHC, the joint logic of problems and propositions,
are constructed, including a class of subset/sheaf-valued models that is
related to solutions of some actual problems (such as solutions of algebraic
equations) and combines the familiar Leibniz-Euler-Venn semantics of classical
logic with a BHK-type semantics of intuitionistic logic.
To test the models, we consider a number of principles and rules, which
empirically appear to cover all "sufficiently simple" natural conjectures about
the behaviour of the operators ! and ?, and include two hypotheses put forward
by Hilbert and Kolmogorov, as formalized in the language of QHC. Each of these
turns out to be either derivable in QHC or equivalent to one of only 13
principles and 1 rule, of which 10 principles and 1 rule are conservative over
classical and intuitionistic logics. The three classes of models together
suffice to confirm the independence of these 10 principles and 1 rule, and to
determine the full lattice of implications between them, apart from one
potential implication.Comment: 35 pages. v4: Section 4.6 "Summary" is added at the end of the paper.
v3: Major revision of a half of v2. The results are improved and rewritten in
terms of the meta-logic. The other half of v2 (Euclid's Elements as a theory
over QHC) is expected to make part III after a revisio
Linear logic for constructive mathematics
We show that numerous distinctive concepts of constructive mathematics arise
automatically from an interpretation of "linear higher-order logic" into
intuitionistic higher-order logic via a Chu construction. This includes
apartness relations, complemented subsets, anti-subgroups and anti-ideals,
strict and non-strict order pairs, cut-valued metrics, and apartness spaces. We
also explain the constructive bifurcation of classical concepts using the
choice between multiplicative and additive linear connectives. Linear logic
thus systematically "constructivizes" classical definitions and deals
automatically with the resulting bookkeeping, and could potentially be used
directly as a basis for constructive mathematics in place of intuitionistic
logic.Comment: 39 page
- …