Lower bounds on ()

DOI10.1007/978-3-031-08740-0_6MaRDI QIDQ2104252OpenAlexFDO

Authors Merlin Carl

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08740-0_6

zbMATH Keywords

ordinal computabilityinfinite time register machinesgandy ordinals

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 3792154 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Ordinal computability
• Ordinal computability. An introduction to infinitary machines
• Register computations on ordinals
• Taming Koepke's zoo. II: Register machines
• The basic theory of infinite time register machines
• The computational power of infinite time Blum-Shub-Smale machines
• The next admissible ordinal
• Uncountable Gandy Ordinals
• What is the theory ZFC without power set?

Cited in

(2)

• A lower bound for \(|\{a+b: a\in A,\;b\in B,\;P(a,b)\neq 0\}|\)
• A non‐smooth lower bound on ν

This page was built for publication: Lower bounds on \(\beta (\alpha)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104252)