On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75)

&
Mathematical Logic Quarterly 24 (19‐24):291-296 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19780241903

Links

PhilArchive



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

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

Uniformly defined descending sequences of degrees.Harvey Friedman - 1976 - Journal of Symbolic Logic 41 (2):363-367.
The natural hierarchy and quasi-hierarchy of constructibility degrees.Philip Welch - 1986 - Journal of Symbolic Logic 51 (1):130-134.
Akrasia, dispositions and degrees.Jeanne Peijnenburg - 2000 - Erkenntnis 53 (3):285-308.
A simple solution to Friedman's fourth problem.Xavier Caicedo - 1986 - Journal of Symbolic Logic 51 (3):778-784.
Ω*1 as an initial segment of the c-degrees.Marcia Groszek - 1994 - Journal of Symbolic Logic 59 (3):956 - 976.
Two sequences of locally tabular superintuitionistic logics.S. I. Mardaev - 1991 - Studia Logica 50 (2):333 - 342.
$omega^ast_1$ as an Initial Segment of the $c$-Degrees.Marcia Groszek - 1994 - Journal of Symbolic Logic 59 (3):956-976.
On finite lattices of degrees of constructibility.Zofia Adamowicz - 1977 - Journal of Symbolic Logic 42 (3):349-371.
Busy choice sequences refraining formulas and modalities.Ming Xu - 1995 - Studia Logica 54 (3):267 - 301.
On finite lattices of degrees of constructibility of reals.Zofia Adamowicz - 1976 - Journal of Symbolic Logic 41 (2):313-322.
Characterizing the Join-Irreducible Medvedev Degrees.Paul Shafer - 2011 - Notre Dame Journal of Formal Logic 52 (1):21-38.
Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
What shall we do with verisimilitude?Ilkka Niiniluoto - 1982 - Philosophy of Science 49 (2):181-197.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
The bayesian treatment of auxiliary hypotheses.Michael Strevens - 2001 - British Journal for the Philosophy of Science 52 (3):515-537.

Analytics

Added to PP
2013-11-24

Downloads
12 (#1,031,844)

6 months
6 (#448,852)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Applications of iterated perfect set forcing.Marcia J. Groszek - 1988 - Annals of Pure and Applied Logic 39 (1):19-53.
Lattice initial segments of the hyperdegrees.Richard A. Shore & Bjørn Kjos-Hanssen - 2010 - Journal of Symbolic Logic 75 (1):103-130.

Add more citations

References found in this work

Degrees of unsolvability.Joseph Robert Shoenfield - 1972 - New York,: American Elsevier.
Review: Petr Vopenka, Petr Hajek, The Theory of Semisets. [REVIEW]Azriel Levy - 1984 - Journal of Symbolic Logic 49 (4):1422-1423.

Add more references