WEIHRAUCH GOES BROUWERIAN

DOI10.1017/jsl.2020.76zbMath1485.03156arXiv1809.00380OpenAlexW2891388094MaRDI QIDQ5858925

Guido Gherardi, Vasco Brattka

Publication date: 15 April 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.00380

zbMATH Keywords

computable analysisBrouwer algebraWeihrauch complexityintuitionistic and linear logic

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Heyting algebras (lattice-theoretic aspects) (06D20) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)

Related Items

The fixed-point property for represented spaces ⋮ THE DISCONTINUITY PROBLEM ⋮ Unnamed Item ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Residuated lattices. An algebraic glimpse at substructural logics
• Theory of representations
• A topological view on algebraic computation models
• On the uniform computational content of computability theory
• Embedding Brouwer algebra in the Medvedev lattice
• Completion of choice
• Joins in the strong Weihrauch degrees
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Quantales and (noncommutative) linear logic
• On the algebraic structure of Weihrauch degrees
• ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
• The degree structure of Weihrauch-reducibility
• Handbook of Computability and Complexity in Analysis