Provident sets and rudimentary set forcing

DOI10.4064/fm230-2-1zbMath1373.03104OpenAlexW2330980320MaRDI QIDQ4983106

Adrian R. D. Mathias

Publication date: 14 April 2015

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/fm230-2-1

zbMATH Keywords

progressforcingprovident closureprovident setrudimentary recursiongentle separationnominator

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Axiomatics of classical set theory and its fragments (03E30) Other aspects of forcing and Boolean-valued models (03E40) Higher-type and set recursion theory (03D65)

Related Items (10)

Effectivity and reducibility with ordinal Turing machines ⋮ AN AXIOMATIC APPROACH TO FORCING IN A GENERAL SETTING ⋮ Decision times of infinite computations ⋮ $$ITRM$$-Recognizability from Random Oracles ⋮ The formal verification of the ctm approach to forcing ⋮ Long Borel games ⋮ Mathias and set theory ⋮ Rudimentary recursion, gentle functions and provident sets ⋮ GAMES AND INDUCTION ON REALS ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines

Cites Work

• Uncountable Admissibles I: Forcing

This page was built for publication: Provident sets and rudimentary set forcing