On the V3-Theory of the Factor Lattice by the Major Subset Relation

In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 224--139 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Theory of completeness for logical spaces.Kensaku Gomi - 2009 - Logica Universalis 3 (2):243-291.
A lattice-valued set theory.Satoko Titani - 1999 - Archive for Mathematical Logic 38 (6):395-421.
Nondiversity in substructures.James H. Schmerl - 2008 - Journal of Symbolic Logic 73 (1):193-211.
The Logic of Experimental Questions.R. I. G. Hughes - 1982 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1982:243 - 256.
Major subsets and the lattice of recursively enumerable sets.Michael Stob - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 107.
Survey of the steinhaus tiling problem.Steve Jackson & R. Daniel Mauldin - 2003 - Bulletin of Symbolic Logic 9 (3):335-361.
Properties, Powers, and the Subset Account of Realization.Paul Audi - 2012 - Philosophy and Phenomenological Research 84 (3):654-674.

Analytics

Added to PP
2014-01-26

Downloads
8 (#1,315,307)

6 months
3 (#969,763)

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