The Length Problem for Co-R.E. Sets

Abstract

This article has no associated abstract. (fix it)

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,879

External links

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

Through your library

Analytics

Added to PP
2015-12-02

Downloads
17 (#642,528)

6 months
1 (#386,016)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

Similar books and articles

The Length Problem for Co‐R.E. Sets.Martin Kummer - 1988 - Mathematical Logic Quarterly 34 (3):277-282.
Kolmogorov Complexity and Noncomputability.George Davie - 2002 - Mathematical Logic Quarterly 48 (4):574-581.
Non‐Circular, Non‐Well‐Founded Set Universes.Athanassios Tzouvaras - 1993 - Mathematical Logic Quarterly 39 (1):454-460.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
On Some Extensions of the Projective Hierarchy.Carlos A. Di Prisco & Jimena Llopis - 1987 - Annals of Pure and Applied Logic 36:105-113.
What is Length?Frank Henmueller & Karl Menger - 1961 - Philosophy of Science 28 (2):172-177.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Post's Problem for Reducibilities of Bounded Complexity.Valeriy K. Bulitko - 2002 - Mathematical Logic Quarterly 48 (3):367-373.