Pages that link to "Item:Q4983106"
From MaRDI portal
The following pages link to Provident sets and rudimentary set forcing (Q4983106):
Displaying 11 items.
- The monadic theory of \((\omega{}_ 2,<)\) may be complicated (Q1190619) (← links)
- Long Borel games (Q2048863) (← links)
- The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- Rudimentary recursion, gentle functions and provident sets (Q2345391) (← links)
- Mathias and set theory (Q2813682) (← links)
- $$ITRM$$-Recognizability from Random Oracles (Q3195690) (← links)
- GAMES AND INDUCTION ON REALS (Q5021933) (← links)
- Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)
- AN AXIOMATIC APPROACH TO FORCING IN A GENERAL SETTING (Q5044313) (← links)
- The formal verification of the ctm approach to forcing (Q6151819) (← links)
