Minimal Coding

Annals of Pure and Applied Logic 41 (3):233-297 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90002-x

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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

Sy D. Friedman. Strong coding. Annals of pure and applied logic, vol. 35, pp. 1–98. - Sy D. Friedman. A guide to “Strong coding.”Annals of pure and applied logic, vol. 35, pp. 99–122. [REVIEW]Philip Welch - 1990 - Journal of Symbolic Logic 55 (3):1311-1313.
Friedman, Sy D. and VeliCkovit, B., Al-Definability.I. Hodkinson, R. Kaye, I. Korec, F. Maurin, H. Mildenberger & F. O. Wagner - 1997 - Annals of Pure and Applied Logic 89 (1):277.
Review: Sy D. Friedman, Strong Coding; Sy D. Friedman, A Guide to "Strong Coding.". [REVIEW]Philip Welch - 1990 - Journal of Symbolic Logic 55 (3):1311-1313.
Farah, I., Basis problem for turbulent actions I: Tsirelson submeasures (1} 3) 189} 203 Feitosa, HA and Lo4redo D: Ottaviano, IM, Conservative translations (1} 3) 205} 227 Friedman, Sy D., see Bagaria, J.(1} 3) 3} 13. [REVIEW]R. A. Lewin, I. F. Mikenberg & M. G. Schwarze - 2001 - Annals of Pure and Applied Logic 108 (373):374.
Review: Sy. D. Friedman, $beta$-Recursion Theory; Sy D. Friedman, Post's Problem without Admissibility. [REVIEW]Steven Homer - 1981 - Journal of Symbolic Logic 46 (3):664-665.
Π10 classes and minimal degrees.Marcia J. Groszek & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 87 (2):117-144.
Friedman-reflexivity.Albert Visser - 2022 - Annals of Pure and Applied Logic 173 (9):103160.
Sheard, M., see Friedman, H.H. Friedman - 1995 - Annals of Pure and Applied Logic 71:307.
Strong coding.Sy D. Friedman - 1987 - Annals of Pure and Applied Logic 35 (C):1-98.
A guide to “strong coding”.Sy D. Friedman - 1987 - Annals of Pure and Applied Logic 35 (C):99-122.

Analytics

Added to PP
2014-01-16

Downloads
18 (#1,108,436)

6 months
4 (#1,246,434)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

On coding uncountable sets by reals.Joan Bagaria & Vladimir Kanovei - 2010 - Mathematical Logic Quarterly 56 (4):409-424.
Equivalence relations which are borel somewhere.William Chan - 2017 - Journal of Symbolic Logic 82 (3):893-930.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Coding the Universe.A. Beller, R. Jensen & P. Welch - 1982 - Cambridge University Press.
A guide to "coding the universe" by Beller, Jensen, Welch.Sy D. Friedman - 1985 - Journal of Symbolic Logic 50 (4):1002-1019.

Add more references