Strong coding

Annals of Pure and Applied Logic 35 (C):1-98 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(87)90057-1

Other Versions

reprint Friedman, Sy D. (1990) "Strong Coding". Journal of Symbolic Logic 55(3):1311-1313

Links

PhilArchive



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

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

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.
A guide to “strong coding”.Sy D. Friedman - 1987 - Annals of Pure and Applied Logic 35 (C):99-122.
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.
A simpler proof of Jensen's coding theorem.Sy D. Friedman - 1994 - Annals of Pure and Applied Logic 70 (1):1-16.
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.
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.

Analytics

Added to PP
2014-01-16

Downloads
30 (#731,182)

6 months
11 (#305,870)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A simpler proof of Jensen's coding theorem.Sy D. Friedman - 1994 - Annals of Pure and Applied Logic 70 (1):1-16.

Add more citations

References found in this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.

Add more references