Search Results - "Fejer, Peter"

  • Showing 1 - 12 results of 12
Refine Results
  1. 1

    Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices by Ambos-Spies, Klaus, Fejer, Peter A., Lempp, Steffen, Lerman, Manuel

    Published in The Journal of symbolic logic (01-09-1996)
    “…We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursively enumerable sets. The key to this decision procedure is…”
    Get full text
    Journal Article
  2. 2

    Degree theoretical splitting properties of recursively enumerable sets by Ambos-Spies, Klaus, Fejer, Peter A.

    Published in The Journal of symbolic logic (01-12-1988)
    “…A recursively enumerable splitting of an r.e. set A is a pair of r.e. sets B and C such that A = B ∪ C and B ∩ C = ⊘. Since for such a splitting deg A = deg B…”
    Get full text
    Journal Article
  3. 3

    Enumerations of the Kolmogorov function by Beigel, Richard, Buhrman, Harry, Fejer, Peter, Fortnow, Lance, Grabowski, Piotr, Longpré, Luc, Muchnik, Andrej, Stephan, Frank, Torenvliet, Leen

    Published in The Journal of symbolic logic (01-06-2006)
    “…A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for…”
    Get full text
    Journal Article
  4. 4
  5. 5

    Embeddings of [formula omitted] and the contiguous degrees by Ambos-Spies, Klaus, Fejer, Peter A.

    Published in Annals of pure and applied logic (2001)
    “…Downey and Lempp (J. Symbolic Logic 62 (1997) 1215–1240) have shown that the contiguous computably enumerable (c.e.) degrees, i.e. the c.e. Turing degrees…”
    Get full text
    Journal Article
  6. 6

    Lattice representations for computability theory by Fejer, Peter A.

    Published in Annals of pure and applied logic (05-10-1998)
    “…Lattice representations are an important tool for computability theorists when they embed nondistributive lattices into degree-theoretic structures. In this…”
    Get full text
    Journal Article
  7. 7
  8. 8

    Branching Degrees above low Degrees by Fejer, Peter A.

    “…In this paper, we investigate the location of the branching degrees within the recursively enumerable (r.e) degrees. We show that there is a branching degree…”
    Get full text
    Journal Article
  9. 9
  10. 10

    Degree theoretical splitting properties of recursively enumerable sets by Ambos-Spies, Klaus, Fejer, Peter A.

    Published in The Journal of symbolic logic (01-12-1988)
    “…A recursively enumerable splitting of an r.e. set A is a pair of r.e. sets B and C such that A = B ∪ C and B ∩ C = ⊘. Since for such a splitting deg A = deg B…”
    Get full text
    Journal Article
  11. 11
  12. 12