Results 1 
6 of
6
Classical And Constructive Hierarchies In Extended Intuitionistic Analysis
"... This paper introduces an extension of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(#) on Baire space with t ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper introduces an extension of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(#) on Baire space with the property that every constructive partial functional defined on {# : R(#)} is continuous there. The domains of continuity for coincide with the stable relations (those equivalent in to their double negations), while every relation R(#) is equivalent in #) for some stable A(#, #) (which belongs to the classical analytical hierarchy). The logic of is intuitionistic. The axioms of include countable comprehension, bar induction, Troelstra's generalized continuous choice, primitive recursive Markov's Principle and a classical axiom of dependent choices proposed by Krauss. Constructive dependent choices, and constructive and classical countable choice, are theorems.
UNAVOIDABLE SEQUENCES IN CONSTRUCTIVE ANALYSIS
"... Kleene’s formalization FIM of intuitionistic analysis ([3] and [2]) includes bar induction, countable and continuous choice, but is consistent with the statement that there are no nonrecursive functions ([5]). Veldman ([12]) showed that in FIM the constructive analytical hierarchy collapses at Σ 1 ..."
Abstract
 Add to MetaCart
Kleene’s formalization FIM of intuitionistic analysis ([3] and [2]) includes bar induction, countable and continuous choice, but is consistent with the statement that there are no nonrecursive functions ([5]). Veldman ([12]) showed that in FIM the constructive analytical hierarchy collapses at Σ 1 2. These are serious obstructions
Oberwolfach Proof Theory and Constructive Math
"... Vesley [1965], as extended by Kleene [1969]) includes bar induction, countable and continuous choice, but cannot prove that the constructive arithmetical hierarchy is proper. Veldman showed that in FIM the constructive analytical hierarchy collapses at Σ 1 2. These are serious obstructions to interp ..."
Abstract
 Add to MetaCart
Vesley [1965], as extended by Kleene [1969]) includes bar induction, countable and continuous choice, but cannot prove that the constructive arithmetical hierarchy is proper. Veldman showed that in FIM the constructive analytical hierarchy collapses at Σ 1 2. These are serious obstructions to interpreting the constructive content of classical analysis, just as the collapse of the arithmetical hierarchy at Σ 0 3 in HA + MP0 + ECT0 limits the scope and effectiveness of recursive analysis. Question: Can we do better by working within classical extensions of nonclassical theories, or within classically correct theories obeying e.g. Church’s Rule or Brouwer’s Rule? We work in a twosorted language L with variables over numbers and oneplace numbertheoretic functions (choice sequences). Our base theory M – the minimal theory used by Kleene [1969] to formalize the theory of recursive partial functionals, function
SOME AXIOMS FOR CONSTRUCTIVE ANALYSIS
"... Abstract. This note explores the common core of constructive, intuitionistic, recursive and classical analysis from an axiomatic standpoint. In addition to clarifying the relation between Kleene’s and Troelstra’s minimal formal theories of numbers and numbertheoretic sequences, we propose some modi ..."
Abstract
 Add to MetaCart
Abstract. This note explores the common core of constructive, intuitionistic, recursive and classical analysis from an axiomatic standpoint. In addition to clarifying the relation between Kleene’s and Troelstra’s minimal formal theories of numbers and numbertheoretic sequences, we propose some modified choice principles and other function existence axioms which may be of use in reverse constructive analysis.
ANOTHER UNIQUE WEAK KÖNIG’S LEMMA WKL!!
"... Abstract. In [2] J. Berger and Ishihara proved, via a circle of informal implications involving countable choice, that Brouwer’s Fan Theorem for detachable bars on the binary fan is equivalent in Bishop’s sense to various principles including a version WKL! of Weak König’s Lemma with a strong effect ..."
Abstract
 Add to MetaCart
Abstract. In [2] J. Berger and Ishihara proved, via a circle of informal implications involving countable choice, that Brouwer’s Fan Theorem for detachable bars on the binary fan is equivalent in Bishop’s sense to various principles including a version WKL! of Weak König’s Lemma with a strong effective uniqueness hypothesis. Schwichtenberg [9] proved the equivalence directly and formalized his proof in Minlog. We verify that his result does not require countable choice, and derive a separation principle SP from the Fan Theorem, in a minimal intuitionistic system M of analysis with function comprehension. In contrast, WKL!! comes from Weak König’s lemma WKL by adding the hypothesis that any two infinite paths must agree. WKL!! is interderivable over M with the conjunction of a consequence of Markov’s Principle and the double negation of WKL. This decomposition is in the spirit of Ishihara’s [4] and J. Berger’s [1]. Kleene’s function realizability and the author’s modified realizability establish that WKL!! is strictly weaker than WKL and strictly stronger than WKL!.
Note on Π 0 n+1LEM, Σ0 n+1LEM and Σ0 n+1DNE⋆
"... Abstract. In [1] Akama, Berardi, Hayashi and Kohlenbach used a monotone modified realizability interpretation to establish the relative independence of Σ 0 n+1DNE from Π 0 n+1LEM over HA, and hence the independence of Σ 0 n+1LEM from Π 0 n+1LEM over HA, for all n ≥ 0. We show that the same relat ..."
Abstract
 Add to MetaCart
Abstract. In [1] Akama, Berardi, Hayashi and Kohlenbach used a monotone modified realizability interpretation to establish the relative independence of Σ 0 n+1DNE from Π 0 n+1LEM over HA, and hence the independence of Σ 0 n+1LEM from Π 0 n+1LEM over HA, for all n ≥ 0. We show that the same relative independence results hold for these arithmetical principles over Kleene and Vesley’s system FIM of intuitionistic analysis [3], which extends HA and is consistent with PA but not with classical analysis. 1 The double negations of the closures of Σ 0 n+1LEM, Σ 0 n+1DNE and Π 0 n+1LEM are also considered, and shown to behave differently with respect to HA and FIM. Various elementary questions remain to be answered.