Sy D. Friedman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2018

Coherent Systems of finite Support iterationsVera Fischer, Sy D. Friedman, Diego Alejandro Mejía, Diana Carolina Montoya. JSYML, 83(1):208-236, 2018. [doi]

2009

Large cardinals and locally defined well-orders of the universeDavid Asperó, Sy D. Friedman. APAL, 157(1):1-15, 2009. [doi]

2008

Homogeneous iteration and measure one covering relative to HODNatasha Dobrinen, Sy D. Friedman. AML, 47(7-8):711-718, 2008. [doi]

Easton s theorem and large cardinalsSy D. Friedman, Radek Honzik. APAL, 154(3):191-208, 2008. [doi]

2005

Definability degreesSy D. Friedman. mlq, 51(5):448-449, 2005. [doi]

Genericity and Large CardinalsSy D. Friedman. jml, 5(2), 2005. [doi]

2004

Generic Sigma:::1:::::3:: absolutenessSy D. Friedman. JSYML, 69(1):73-80, 2004. [doi]

2003

Universally Baire sets and definable well-orderings of the realsSy D. Friedman, Ralf Schindler. JSYML, 68(4):1065-1081, 2003. [doi]

Cardinal-preserving extensionsSy D. Friedman. JSYML, 68(4):1163-1170, 2003. [doi]

Classification theory and 0:::#:::Sy D. Friedman, Tapani Hyttinen, Mika Rautila. JSYML, 68(2):580-588, 2003.

2002

0:::#::: and Inner ModelsSy D. Friedman. JSYML, 67(3):924-932, 2002.

2001

Generic absolutenessJoan Bagaria, Sy D. Friedman. APAL, 108(1-3):3-13, 2001.

1999

Ordinal Recursion TheoryC. T. Chong, Sy D. Friedman. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 277-299, North-Holland, 1999. [doi]

1998

Generic SaturationSy D. Friedman. JSYML, 63(1):158-162, 1998.

1997

Delta::1::-DefinabilitySy D. Friedman, Boban Velickovic. APAL, 89(1):93-99, 1997.

Coding without Fine StructureSy D. Friedman. JSYML, 62(3):808-815, 1997.

An elementary approach to the fine structure of LSy D. Friedman, Peter Koepke. bsl, 3(4):453-468, 1997. [doi]

1994

A Simpler proof of Jensen s Coding TheoremSy D. Friedman. APAL, 70(1):1-16, 1994.

Jensen s Sigma:::*::: Theory and the Combinatorial Content of V=LSy D. Friedman. JSYML, 59(3):1096-1104, 1994.

The Genericity ConjectureSy D. Friedman. JSYML, 59(2):606-614, 1994.

1989

Minimal CodingSy D. Friedman. APAL, 41(3):233-297, 1989.

Coding Over a Measurable CardinalSy D. Friedman. JSYML, 54(4):1145-1159, 1989.

1987

Strong codingSy D. Friedman. APAL, 35:1-3, 1987. [doi]

A guide to "strong coding"Sy D. Friedman. APAL, 35:99-122, 1987. [doi]

1985

A Guide to Coding the Universe by Beller, Jensen, WelchSy D. Friedman. JSYML, 50(4):1002-1019, 1985.

1984

Annual Meeting of the Association for Symbolic Logic: Boston 1983George Boolos, Sy D. Friedman. JSYML, 49(4):1441-1449, 1984.

1Sy D. Friedman. APAL, 26(2):103-122, 1984. [doi]

1983

ωC. T. Chong, Sy D. Friedman. APAL, 24(1):87-97, 1983. [doi]

Some Recent Developments in Higher Recursion TheorySy D. Friedman. JSYML, 48(3):629-642, 1983.

1982

Steel forcing and barwise compactnessSy D. Friedman. APAL, 22(1):31-46, 1982. [doi]

1981

Meeting of the Association for Symbolic Logic: New York 1979George Boolos, Sy D. Friedman, Harold Hodes. JSYML, 46(2):427-434, 1981.

1979

HC of an Admissible SetSy D. Friedman. JSYML, 44(1):95-102, 1979.

Sign in or sign up to see more results.

runs on WebDSL