On the computational content of Zorn's lemma
From MaRDI portal
Publication:5145679
DOI10.1145/3373718.3394745zbMath1498.03153arXiv2001.03540OpenAlexW3099555404MaRDI QIDQ5145679
No author found.
Publication date: 21 January 2021
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03540
Zorn's lemmadomain theorycontinuous functionalshigher-order computabilityGödel's functional interpretation
Functionals in proof theory (03F10) Axiom of choice and related propositions (03E25) Relative consistency and interpretations (03F25) Higher-type and set recursion theory (03D65)
Related Items (3)
The Jacobson radical for an inconsistency predicate ⋮ A universal algorithm for Krull's theorem ⋮ Maximal ideals in countable rings, constructively
This page was built for publication: On the computational content of Zorn's lemma
