On coherent families of finite-to-one functions

DOI10.2307/2275329zbMath0783.03030OpenAlexW2099566154MaRDI QIDQ5287684

Piotr Koszmider

Publication date: 17 August 1993

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

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

zbMATH Keywords

Axiom Aiterated forcingcountable-finite gamecoherent families of finite-to-one functions

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40)

Related Items

Meager sets, games and singular cardinals ⋮ Resurrection axioms and uplifting cardinals ⋮ Numerosities of point sets over the real line ⋮ The Bounded Axiom A Forcing Axiom ⋮ Coherent forests

Cites Work

• Unnamed Item
• Unnamed Item
• Concerning n-Tactics in the Countable-Finite Game
• The fine structure of the constructible hierarchy