A selection theorem

DOI10.2307/2273450zbMATH Open0533.03029OpenAlexW2137109381MaRDI QIDQ5896236

L. M. Kirousis

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273450

zbMATH Keywords

closureset recursionbounded existential quantifiersdeterministic existential quantifiernon-deterministic existential quantifierrelations over an infinite cardinalset- recursive regularityset-recursive cofinality

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Inductive definability (03D70)

Cites Work

• Degrees of unsolvability of constructible sets of integers

Related Items (5)

[[Publication:5440724|Title not available (Why is that?)]] ⋮ A selection theorem for paved spaces ⋮ A simultaneous selection theorem ⋮ Selection theorem for systems with inheritance ⋮ [[Publication:3769592|Title not available (Why is that?)]]

This page was built for publication: A selection theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896236)