Peter A. Fejer

Publication Activity (10 Years)

Years Active: 1983-2006
Publications (10 Years): 0

Publications

Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet
Enumerations of the Kolmogorov function. J. Symb. Log. 71 (2) (2006)
Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
Enumerations of the Kolmogorov Function Electron. Colloquium Comput. Complex. (015) (2004)
Klaus Ambos-Spies, Peter A. Fejer
and the contiguous degrees. Ann. Pure Appl. Log. 112 (2-3) (2001)
Peter A. Fejer, Richard A. Shore
Every incomplete computably enumerable truth-table degree is branching. Arch. Math. Log. 40 (2) (2001)
Peter A. Fejer
Lattice Representations for Computability Theory. Ann. Pure Appl. Log. 94 (1-3) (1998)
Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. J. Symb. Log. 61 (3) (1996)
Peter A. Fejer
Degrees. Math. Log. Q. 35 (1) (1989)
Klaus Ambos-Spies, Peter A. Fejer
Degree Theoretical Splitting Properties of Recursively Enumerable Sets. J. Symb. Log. 53 (4) (1988)
Peter A. Fejer, Richard A. Shore
Infima of recursively enumerable truth table degrees. Notre Dame J. Formal Log. 29 (3) (1988)
Peter A. Fejer
The density of the nonbranching degrees. Ann. Pure Appl. Log. 24 (2) (1983)