Characterising the largest, countable partial ordering

Mathematical Logic Quarterly 21 (1):353-354 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
The Settling-Time Reducibility Ordering.Barbara F. Csima & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (3):1055 - 1071.
Countable Fréchetα 1-spaces may be first countable.Alan Dow & Juris Stepräns - 1992 - Archive for Mathematical Logic 32 (1):33-50.
Infinite chains and antichains in computable partial orderings.E. Herrmann - 2001 - Journal of Symbolic Logic 66 (2):923-934.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Measure Theory Aspects of Locally Countable Orderings.Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):958 - 968.
Comparing theories by their positive and negative contents.Isabella C. Burger & Johannes Heidema - 1994 - British Journal for the Philosophy of Science 45 (2):605-630.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.

Analytics

Added to PP
2013-11-24

Downloads
16 (#774,858)

6 months
2 (#670,035)

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