Journal of Symbolic Logic 58 (1):128-138 (1993)
AbstractWe consider the existence of coherent families of finite-to-one functions on countable subsets of an uncountable cardinal κ. The existence of such families for κ implies the existence of a winning 2-tactic for player TWO in the countable-finite game on κ. We prove that coherent families exist on κ = ωn, where n ∈ ω, and that they consistently exist for every cardinal κ. We also prove that iterations of Axiom A forcings with countable supports are Axiom A
Added to PP
Historical graph of downloads
References found in this work
The Fine Structure of the Constructible Hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Citations of this work
Resurrection Axioms and Uplifting Cardinals.Joel David Hamkins & Thomas A. Johnstone - 2014 - Archive for Mathematical Logic 53 (3-4):463-485.
Baumgartnerʼs Conjecture and Bounded Forcing Axioms.David Asperó, Sy-David Friedman, Miguel Angel Mota & Marcin Sabok - 2013 - Annals of Pure and Applied Logic 164 (12):1178-1186.
The Bounded Axiom A Forcing Axiom.Thilo Weinert - 2010 - Mathematical Logic Quarterly 56 (6):659-665.
Similar books and articles
The Patient in the Family: An Ethics of Medicine and Families.Hilde Lindemann - 1995 - Routledge.
Cohen-Stable Families of Subsets of Integers.Miloš S. Kurilić - 2001 - Journal of Symbolic Logic 66 (1):257-270.
Finitary Sketches.J. Adámek, P. T. Johnstone, J. A. Makowsky & J. Rosický - 1997 - Journal of Symbolic Logic 62 (3):699-707.
The Axiom of Choice for Well-Ordered Families and for Families of Well- Orderable Sets.Paul Howard & Jean E. Rubin - 1995 - Journal of Symbolic Logic 60 (4):1115-1117.
Countable Models of Trivial Theories Which Admit Finite Coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
Combinatorics for the Dominating and Unsplitting Numbers.Jason Aubrey - 2004 - Journal of Symbolic Logic 69 (2):482-498.
Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.