Peter G. Hinman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2017

Recursion-Theoretic HierarchiesPeter G. Hinman. Volume 9 of Perspectives in Logic, Cambridge University Press, 2017. [doi]

2012

A survey of Mučnik and Medvedev degreesPeter G. Hinman. bsl, 18(2):161-229, 2012. [doi]

2008

Degrees of difficulty of generalized r.e. separating classesDouglas A. Cenzer, Peter G. Hinman. AML, 46(7-8):629-647, 2008. [doi]

2007

Medvedev Degrees of Generalized R.E. separating ClassesDouglas Cenzer, Peter G. Hinman. ENTCS, 167:203-223, 2007. [doi]

2003

Density of the Medvedev lattice of Pi01 classesDouglas A. Cenzer, Peter G. Hinman. AML, 42(6):583-600, 2003. [doi]

1999

Recursion on Abstract StructuresPeter G. Hinman. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 315-359, North-Holland, 1999. [doi]

1994

Iterated relative recursive enumerabilityPeter A. Cholak, Peter G. Hinman. AML, 33(5):321-346, 1994. [doi]

1991

Jump Embeddings in Turing DegreesPeter G. Hinman, Theodore A. Slaman. JSYML, 56(2):563-591, 1991.

1986

Meeting of the Association for Symbolic Logic: Chicago, 1985Andreas Blass, Louise Hay, Peter G. Hinman. JSYML, 51(2):507-510, 1986.

1973

Degrees of Continuous FunctionalsPeter G. Hinman. JSYML, 38(3):393-395, 1973.

Sign in or sign up to see more results.

runs on WebDSL