Peter A. Fejer

Available identifiers

Publication	Date of Publication	Type
Logical foundations of computer science. In 2 volumes. Vol 1: propositional logic. Vol 2: predicate logic	2024-09-10	Paper
https://portal.mardi4nfdi.de/entity/Q4619825	2019-02-07	Paper
Enumerations of the Kolmogorov function	2006-08-03	Paper
Embeddings of \(N_5\) and the contiguous degrees	2003-01-30	Paper
Every incomplete computably enumerable truth-table degree is branching	2002-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4944898	2000-03-22	Paper
Lattice representations for computability theory	1999-09-02	Paper
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices	1997-06-03	Paper
https://portal.mardi4nfdi.de/entity/Q4764099	1995-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q3997953	1993-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q3496330	1990-01-01	Paper
Embedding Lattices with Top Preserved Below Non‐GL₂ Degrees	1989-01-01	Paper
Degree theoretical splitting properties of recursively enumerable sets	1988-01-01	Paper
Infima of recursively enumerable truth table degrees	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3724316	1985-01-01	Paper
The density of the nonbranching degrees	1983-01-01	Paper
Branching Degrees above low Degrees	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3962983	1981-01-01	Paper

This page was built for person: Peter A. Fejer