Logical Approaches to Computational Barriers
From MaRDI portal
Publication:5898800
DOI10.1007/11780342zbMath1145.03339OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898800
Publication date: 30 April 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780342
Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30)
Related Items
A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ Realizability Models Separating Various Fan Theorems ⋮ Equivalence of bar induction and bar recursion for continuous functions with continuous moduli ⋮ Decidable fan theorem and uniform continuity theorem with continuous moduli ⋮ Coding of real‐valued continuous functions under WKL$\mathsf {WKL}$ ⋮ Reclassifying the antithesis of Specker's theorem ⋮ Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem ⋮ Reflections on function spaces ⋮ Characterising Brouwer's continuity by bar recursion on moduli of continuity ⋮ The anti-Specker property, a Heine-Borel property, and uniform continuity ⋮ A continuity principle equivalent to the monotone \(\Pi^0_1\) fan theorem ⋮ A fan-theoretic equivalent of the antithesis of Specker's theorem ⋮ The anti-Specker property, positivity, and total boundedness ⋮ Intuitionistic sequential compactness? ⋮ Sequences of real functions on [0,1 in constructive reverse mathematics] ⋮ SEPARATING THE FAN THEOREM AND ITS WEAKENINGS II ⋮ Problems, solutions, and completions
This page was built for publication: Logical Approaches to Computational Barriers
