A problem of Laczkovich: How dense are set systems with no large independent sets?

Annals of Pure and Applied Logic 167 (10):879-896 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.09.004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
Meager nowhere-dense games (IV): N-tactics.Marion Scheepers - 1994 - Journal of Symbolic Logic 59 (2):603-605.
The dense simple sets are orbit complete with respect to the simple sets.Peter Cholak - 1998 - Annals of Pure and Applied Logic 94 (1-3):37-44.
Van Douwen’s diagram for dense sets of rationals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 143 (1-3):54-69.
Local Density of Kleene Degrees.Hisato Muraki - 1995 - Mathematical Logic Quarterly 41 (2):183-189.
Large sets in intuitionistic set theory.Harvey Friedman & Andrej Ščedrov - 1984 - Annals of Pure and Applied Logic 27 (1):1-24.
Expansions of o-minimal structures by dense independent sets.Alfred Dolich, Chris Miller & Charles Steinhorn - 2016 - Annals of Pure and Applied Logic 167 (8):684-706.
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1-2):51-60.
The algebraic structure of the isomorphic types of tally, polynomial time computable sets.Yongge Wang - 2002 - Archive for Mathematical Logic 41 (3):215-244.
Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401-439.
More canonical forms and dense free subsets.Heike Mildenberger - 2004 - Annals of Pure and Applied Logic 125 (1-3):75-99.
Independent axiomatizability of sets of sentences.Piotr Wojtylak - 1989 - Annals of Pure and Applied Logic 44 (3):259-299.
More on lower bounds for partitioning α-large sets.Henryk Kotlarski, Bożena Piekart & Andreas Weiermann - 2007 - Annals of Pure and Applied Logic 147 (3):113-126.
Too Many Alternatives: density, symmetry and other predicaments.Danny Fox - unknown
The {L}aczkovich—{K}omjáth property for coanalytic equivalence relations.Su Gao, Steve Jackson & Vincent Kieftenbeld - 2010 - Journal of Symbolic Logic 75 (3):1091-1101.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,380,763)

6 months
1 (#1,463,894)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references