Filter spaces: towards a unified theory of large cardinal and embedding axioms BEIGEL, R., GASARCH, W. and OWINGS, J., Nondeterministic bounded query reducibilities [Book Review]

, , &
Annals of Pure and Applied Logic 41:299 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

External links

  • This entry has no external links. Add one.
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

Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
Filter spaces: towards a unified theory of large cardinal and embedding axioms.Arthur Apter, Carlos Diprisco, James Henle & William Swicker - 1989 - Annals of Pure and Applied Logic 41 (2):93-106.
Review: Richard Beigel, William I. Gasarch, Louise Hay, Bounded Query Classes and the Difference Hierarchy. [REVIEW]Melven Krom - 1993 - Journal of Symbolic Logic 58 (1):359-360.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
Intrinsic Reducibilities.Timothy H. McNicholl - 2000 - Mathematical Logic Quarterly 46 (3):393-407.
Ramsey-like cardinals.Victoria Gitman - 2011 - Journal of Symbolic Logic 76 (2):519 - 540.
On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
The Consistency Strength of $$\aleph{\omega}$$ and $$\aleph_{{\omega}1}$$ Being Rowbottom Cardinals Without the Axiom of Choice.Arthur W. Apter & Peter Koepke - 2006 - Archive for Mathematical Logic 45 (6):721-737.
Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Incompatible Ω-Complete Theories.Peter Koellner & W. Hugh Woodin - 2009 - Journal of Symbolic Logic 74 (4):1155 - 1170.
Equational Boolean relation theory.Harvey Friedman - manuscript
On the structures inside truth-table degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.

Analytics

Added to PP
2014-04-03

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references