3 citations · 9 across the 17 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2010★ 1 cited
Conflict free colorings of (strongly) almost disjoint set-systems
András Hajnal, István Juhász, Lajos Soukup +1
A set-system is a -system iff , for each , and is -almost disjoint. We write iff every -system has a "conflic…
math.LO2007
Lindelof spaces of singular density
Istvan Juhasz, Saharon Shelah
A cardinal lambda is called omega-inaccessible if for all mu < lambda we have mu^omega<lambda. We show that for every omega-inaccessible cardinal lambda there is a CCC (hence cardi…
math.LO1998
Strongly almost disjoint families, II
Andras Hajnal, Istvan Juhasz, Saharon Shelah
The relations M(kappa,lambda,mu)->B [resp. B(sigma)] meaning that if A subset [kappa]^lambda with |A|=kappa is mu-almost disjoint then A has property B [resp. has a sigma-transvers…