The density of the nonbranching degrees. - Peter A. Fejer (Ann. Pure Appl. Log., 1983)

Degree Theoretical Splitting Properties of Recursively Enumerable Sets. - Klaus Ambos-Spies; Peter A. Fejer (J. Symb. Log., 1988)

Infima of recursively enumerable truth table degrees. - Peter A. Fejer; Richard A. Shore (Notre Dame J. Formal Log., 1988)

Embedding Lattices with Top Preserved Below Non-GL2 Degrees. - Peter A. Fejer (Math. Log. Q., 1989)

Mathematical Foundations of Computer Science - Sets, Relations, and Induction - Peter A. Fejer; Dan A. Simovici (Springer, 1991)

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)

Lattice Representations for Computability Theory. - Peter A. Fejer (Ann. Pure Appl. Log., 1998)

Every incomplete computably enumerable truth-table degree is branching. - Peter A. Fejer; Richard A. Shore (Arch. Math. Log., 2001)

Embedding of N5 and the contiguous degrees. - Klaus Ambos-Spies; Peter A. Fejer (Ann. Pure Appl. Log., 2001)

Enumerations of the Kolmogorov function. - Richard Beigel; Harry Buhrman; Peter A. Fejer; Lance Fortnow; Piotr Grabowski; Luc Longpré; Andrej Muchnik; Frank Stephan 001; Leen Torenvliet (J. Symb. Log., 2006)

Degrees of Unsolvability. - Klaus Ambos-Spies; Peter A. Fejer (Computational Logic, 2014)

Logical Foundations of Computer Science - (In 2 volumes) Vol 1: Propositional LogicVol 2: Predicate Logic - Peter A. Fejer; Dan A. Simovici (Logical Foundations of Computer Science, 2024)