The Length Problem for Co-R.E. Sets

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (3):277-282 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19880340311

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

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.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
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.
Supplementary report: The effects of problem length on transfer during learning-set performance.Marvin Levine, Harry F. Harlow & Tania Pontrelli - 1961 - Journal of Experimental Psychology 61 (2):192.
Propositional proof systems, the consistency of first order theories and the complexity of computations.Jan Krajíček & Pavel Pudlák - 1989 - Journal of Symbolic Logic 54 (3):1063-1079.
Subgoal length versus full solution length in predicting Tower of Hanoi problem-solving performance.Herman H. Spitz, Shula K. Minsky & Candace L. Bessellieu - 1984 - Bulletin of the Psychonomic Society 22 (4):301-304.
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.
O konceptualizacji wiedzy nieostrej.Urszula Wybraniec-Skardowska - 1996 - Filozofia Nauki 3.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.

Analytics

Added to PP
2015-12-02

Downloads
18 (#814,090)

6 months
1 (#1,516,429)

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

Add more references