Effective Mathematics of the Uncountable
From MaRDI portal
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Foundations of classical theories (including reverse mathematics) (03B30) Computable structure theory, computable model theory (03C57) Computability and recursion theory (03Dxx) Descriptive set theory (03E15)
Cited in
(9)- Recognizable sets and Woodin cardinals: computation beyond the constructible universe
- On the non-enumerability of L
- Computable structures in generic extensions
- Dialectics of Counting and the Mathematics of Vagueness
- Transfinite recursion in higher reverse mathematics
- Finding bases of uncountable free abelian groups is usually difficult
- Effectivity and reducibility with ordinal Turing machines
- Universal extensions of specialization semilattices
- On the decidability of the theory of modules over the ring of algebraic integers
This page was built for publication: Effective Mathematics of the Uncountable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928781)
