More game-theoretic properties of boolean algebras

Annals of Pure and Applied Logic 26 (1):11-29 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,659

External links

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

Through your library

Similar books and articles

Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
More on the cut and choose game.Jindřich Zapletal - 1995 - Annals of Pure and Applied Logic 76 (3):291-301.
Narrow boolean algebras.Robert Bonnet & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 28 (1):1-12.
Remarks on superatomic Boolean algebras.J. E. Baumgartner - 1987 - Annals of Pure and Applied Logic 33 (2):109.
Recursively rigid Boolean algebras.Jeffrey B. Remmel - 1987 - Annals of Pure and Applied Logic 36:39-52.
Remarks on superatomic boolean algebras.James E. Baumgartner & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):109-129.
Moderate families in Boolean algebras.Lutz Heindorf - 1992 - Annals of Pure and Applied Logic 57 (3):217-250.
On L∞κ-free Boolean algebras.Sakaé Fuchino, Sabine Koppelberg & Makoto Takahashi - 1992 - Annals of Pure and Applied Logic 55 (3):265-284.
Computably categorical Boolean algebras enriched by ideals and atoms.P. E. Alaev - 2012 - Annals of Pure and Applied Logic 163 (5):485-499.

Analytics

Added to PP
2014-01-16

Downloads
34 (#467,954)

6 months
12 (#313,260)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Filters and large cardinals.Jean-Pierre Levinski - 1995 - Annals of Pure and Applied Logic 72 (2):177-212.
More on the cut and choose game.Jindřich Zapletal - 1995 - Annals of Pure and Applied Logic 76 (3):291-301.
Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
On the weak distributivity game.Anastasis Kamburelis - 1994 - Annals of Pure and Applied Logic 66 (1):19-26.

View all 16 citations / Add more citations

References found in this work

Adding a closed unbounded set.J. E. Baumgartner, L. A. Harrington & E. M. Kleinberg - 1976 - Journal of Symbolic Logic 41 (2):481-482.
Games played on Boolean algebras.Matthew Foreman - 1983 - Journal of Symbolic Logic 48 (3):714-723.
Countable approximations and Löwenheim-Skolem theorems.David W. Kueker - 1977 - Annals of Mathematical Logic 11 (1):57.

Add more references