Search the dblp DataBase

Publications of Author

1. Klaus Ambos-Spies, Peter A. Fejer
   Embedding of N₅ and the contiguous degrees. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:112, n:2-3, pp:151-188 [Journal]
   
2. Peter A. Fejer
   Lattice Representations for Computability Theory. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:53-74 [Journal]
   
3. 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 [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:015, pp:- [Journal]
   
4. Klaus Ambos-Spies, Peter A. Fejer
   Degree Theoretical Splitting Properties of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1988, v:53, n:4, pp:1110-1137 [Journal]
   
5. 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. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1996, v:61, n:3, pp:880-905 [Journal]
   
6. 
   Every incomplete computably enumerable truth-table degree is branching. [Citation Graph (, )][DBLP]