Peter A. Fejer

According to our database, Peter A. Fejer authored at least 11 papers between 1983 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2014

Degrees of Unsolvability.

Klaus Ambos-Spies, Peter A. Fejer

Proceedings of the Computational Logic, 2014

2006

Enumerations of the Kolmogorov function.

Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet

J. Symb. Log., 2006

2001

Embedding of N₅ and the contiguous degrees.

Klaus Ambos-Spies, Peter A. Fejer

Ann. Pure Appl. Log., 2001

Every incomplete computably enumerable truth-table degree is branching.

Peter A. Fejer, Richard A. Shore

Arch. Math. Log., 2001

1998

Lattice Representations for Computability Theory.

Peter A. Fejer

Ann. Pure Appl. Log., 1998

1996

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.

Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman

J. Symb. Log., 1996

1991

Mathematical Foundations of Computer Science - Sets, Relations, and Induction

Peter A. Fejer, Dan A. Simovici

Texts and Monographs in Computer Science, Springer, ISBN: 3540974504, 1991

1989

Embedding Lattices with Top Preserved Below Non-<i>GL</i>₂ Degrees.

Peter A. Fejer

Math. Log. Q., 1989

1988

Infima of recursively enumerable truth table degrees.

Peter A. Fejer, Richard A. Shore

Notre Dame J. Formal Log., 1988

Degree Theoretical Splitting Properties of Recursively Enumerable Sets.

Klaus Ambos-Spies, Peter A. Fejer

J. Symb. Log., 1988

1983

The density of the nonbranching degrees.

Peter A. Fejer

Ann. Pure Appl. Log., 1983