A proof of Beigel's cardinality conjecture

Journal of Symbolic Logic 57 (2):677-681 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275299

Links

PhilArchive



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

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

A new proof of Friedman's conjecture.Liang Yu - 2011 - Bulletin of Symbolic Logic 17 (3):455-461.
On the strong Martin conjecture.Masanori Itai - 1991 - Journal of Symbolic Logic 56 (3):862-875.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
Relation algebra reducts of cylindric algebras and an application to proof theory.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Journal of Symbolic Logic 67 (1):197-213.
Kueker's conjecture for stable theories.Ehud Hrushovski - 1989 - Journal of Symbolic Logic 54 (1):207-220.
Proof of a conjecture of Goodman.N. J. Fine - 1954 - Journal of Symbolic Logic 19 (1):41-44.
Using mathematica to understand the computer proof of the Robbins conjecture.Branden Fitelson - manuscript

Analytics

Added to PP
2009-01-28

Downloads
42 (#370,011)

6 months
12 (#200,125)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable categoricity and the Ershov hierarchy.Bakhadyr Khoussainov, Frank Stephan & Yue Yang - 2008 - Annals of Pure and Applied Logic 156 (1):86-95.

Add more citations

References found in this work

Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.

Add more references