E-Recursion, Forcing and C*-Algebras

DOI10.1142/9154zbMath1295.03004OpenAlexW581743158MaRDI QIDQ5495327

No author found.

Publication date: 1 August 2014

Published in: Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9154

Mathematics Subject Classification ID

Consistency and independence results (03E35) Applications of set theory (03E75) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Recursive functions and relations, subrecursive hierarchies (03D20) Other aspects of forcing and Boolean-valued models (03E40) Higher-type and set recursion theory (03D65) Generic absoluteness and forcing axioms (03E57)

Related Items (3)

THE DIAGONAL STRONG REFLECTION PRINCIPLE AND ITS FRAGMENTS ⋮ ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS ⋮ COMBINING RESURRECTION AND MAXIMALITY

This page was built for publication: E-Recursion, Forcing and C*-Algebras