Peter A. Fejer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2014

Degrees of UnsolvabilityKlaus Ambos-Spies, Peter A. Fejer. In Jörg H. Siekmann, editor, Computational Logic. Volume 9 of Handbook of the History of Logic, pages 443-494, Elsevier, 2014. [doi]

2006

Enumerations of the Kolmogorov functionRichard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet. JSYML, 71(2):501-528, 2006. [doi]

2004

Enumerations of the Kolmogorov FunctionRichard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet. eccc, (015), 2004. [doi]

2001

Embedding of N::5:: and the contiguous degreesKlaus Ambos-Spies, Peter A. Fejer. APAL, 112(2-3):151-188, 2001.

Every incomplete computably enumerable truth-table degree is branchingPeter A. Fejer, Richard A. Shore. AML, 40(2):113-123, 2001. [doi]

1998

Lattice Representations for Computability TheoryPeter A. Fejer. APAL, 94(1-3):53-74, 1998.

1996

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-LatticesKlaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman. JSYML, 61(3):880-905, 1996.

1991

Mathematical Foundations of Computer Science - Sets, Relations, and InductionPeter A. Fejer, Dan A. Simovici. Texts and Monographs in Computer Science, Springer, 1991. [doi]

1989

2 DegreesPeter A. Fejer. mlq, 35(1):3-14, 1989. [doi]

1988

Degree Theoretical Splitting Properties of Recursively Enumerable SetsKlaus Ambos-Spies, Peter A. Fejer. JSYML, 53(4):1110-1137, 1988.

Infima of recursively enumerable truth table degreesPeter A. Fejer, Richard A. Shore. ndjfl, 29(3):420-437, 1988. [doi]

1983

The density of the nonbranching degreesPeter A. Fejer. APAL, 24(2):113-130, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL