Peter G. Hinman

According to our database, Peter G. Hinman authored at least 10 papers between 1973 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

Recursion-Theoretic Hierarchies

Peter G. Hinman

Perspectives in Logic 9, Cambridge University Press, ISBN: 9781316717110, 2017

2012

A survey of Mučnik and Medvedev degrees.

Peter G. Hinman

Bull. Symb. Log., 2012

2008

Degrees of difficulty of generalized r.e. separating classes.

Douglas A. Cenzer, Peter G. Hinman

Arch. Math. Log., 2008

2006

Medvedev Degrees of Generalized R.E. separating Classes.

Douglas Cenzer, Peter G. Hinman

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

2003

Density of the Medvedev lattice of Pi01 classes.

Douglas A. Cenzer, Peter G. Hinman

Arch. Math. Log., 2003

1999

Recursion on Abstract Structures.

Peter G. Hinman

Proceedings of the Handbook of Computability Theory, 1999

1994

Iterated relative recursive enumerability.

Peter A. Cholak, Peter G. Hinman

Arch. Math. Log., 1994

1991

Jump Embeddings in Turing Degrees.

Peter G. Hinman, Theodore A. Slaman

J. Symb. Log., 1991

1986

Meeting of the Association for Symbolic Logic: Chicago, 1985.

Andreas Blass, Louise Hay, Peter G. Hinman

J. Symb. Log., 1986

1973

Degrees of Continuous Functionals.

Peter G. Hinman

J. Symb. Log., 1973