Full generalized effective reducibility

DOI10.1007/978-3-031-95908-0_15MaRDI QIDQ6897651zbMATH OpenFDO

Authors Merlin Carl

Publication date 19 November 2025

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

zbMATH Keywords

effective reducibilityHODordinal computabilityordinal Turing machinesset theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Effectivity and reducibility with ordinal Turing machines
• Fine structure
• Generalized effective reducibility
• scientific article; zbMATH DE number 3337693 (Why is no real title available?)
• Infinite time Turing machines
• Inner models from extended logics. I
• Ordinal computability. An introduction to infinitary machines
• Realisability for infinitary intuitionistic set theory
• Set theory. An introduction to independence proofs
• Sufficient conditions for the forcing theorem, and turning proper classes into sets
• THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC
• The HOD dichotomy
• Turing Computations On Ordinals

This page was built for publication: Full generalized effective reducibility

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