Order:
  1.  90
    B. Balcar and F. Franek. Independent families in complete Boolean algebras. Transactions of the American Mathematical Society, vol. 274 (1982), pp. 607–618. - Bohuslav Balcar, Jan Pelant, and Petr Simon. The space of ultrafilters on N covered by nowhere dense sets. Fundamenta mathematicae, vol. 110 (1980), pp. 11–24. - Boban Velickovic. OCA and automorphisms of P(ω)/fin. Topology and its applications, vol. 49 (1993), pp. 1–13.Klaas Pieter Hart, B. Balcar, F. Franek, Bohuslav Balcar, Jan Pelant, Petr Simon & Boban Velickovic - 2002 - Bulletin of Symbolic Logic 8 (4):554.
  2. On the existence of large p-ideals.Winfried Just, A. R. D. Mathias, Karel Prikry & Petr Simon - 1990 - Journal of Symbolic Logic 55 (2):457-465.
    We prove the existence of p-ideals that are nonmeagre subsets of P(ω) under various set-theoretic assumptions.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  17
    Dedicated to Petr Vopeynka.Bohuslav Balcar & Petr Simon - 2001 - Annals of Pure and Applied Logic 109 (1):2-15.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  25
    The name for Kojman–Shelah collapsing function.Bohuslav Balcar & Petr Simon - 2001 - Annals of Pure and Applied Logic 109 (1-2):131-137.
    In the previous paper of this volume, Kojman and Shelah solved our long standing problem of collapsing cardinal κ0 to ω1 by the forcing for singular κ with countable cofinality. The aim of the present paper is to give an explicit construction of the Boolean matrix for this collapse.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  30
    Weak partition properties on trees.Michael Hrušák, Petr Simon & Ondřej Zindulka - 2013 - Archive for Mathematical Logic 52 (5-6):543-567.
    We investigate the following weak Ramsey property of a cardinal κ: If χ is coloring of nodes of the tree κ <ω by countably many colors, call a tree ${T \subseteq \kappa^{ < \omega}}$ χ-homogeneous if the number of colors on each level of T is finite. Write ${\kappa \rightsquigarrow (\lambda)^{ < \omega}_{\omega}}$ to denote that for any such coloring there is a χ-homogeneous λ-branching tree of height ω. We prove, e.g., that if ${\kappa < \mathfrak{p}}$ or ${\kappa > \mathfrak{d}}$ (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  21
    Independent Families in Complete Boolean Algebras.B. Balcar, F. Franek, Bohuslav Balcar, Jan Pelant, Petr Simon & Boban Velickovic - 2002 - Bulletin of Symbolic Logic 8 (4):554-554.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations