E-Recursion, Forcing and C*-Algebras
From MaRDI portal
Publication:5495327
Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Generic absoluteness and forcing axioms (03E57) Applications of set theory (03E75)
Cited in
(6)- ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS
- Combining resurrection and maximality
- THE DIAGONAL STRONG REFLECTION PRINCIPLE AND ITS FRAGMENTS
- Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing
- Iteration theorems for subversions of forcing classes
- Separating subversion forcing axioms
This page was built for publication: E-Recursion, Forcing and C*-Algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495327)