9 found
Order:
Disambiguations
Michael Moses [7]Michael F. Moses [3]
  1.  21
    Relations Intrinsically Recursive in Linear Orders.Michael Moses - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (25-30):467-472.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  13
    Recursive Linear Orders with Recursive Successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
    A successivity in a linear order is a pair of elements with no other elements between them. A recursive linear order with recursive successivities U is recursively categorical if every recursive linear order with recursive successivities isomorphic to U is in fact recursively isomorphic to U . We characterize those recursive linear orders with recursive successivities that are recursively categorical as precisely those with order type k 1 + g 1 + k 2 + g 2 +…+ g n -1 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  4
    Relations Intrinsically Recursive in Linear Orders.Michael Moses - 1986 - Mathematical Logic Quarterly 32 (25‐30):467-472.
  4.  45
    An Undecidable Linear Order That Is $N$-Decidable for All $N$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
    A linear order is -decidable if its universe is and the relations defined by formulas are uniformly computable. This means that there is a computable procedure which, when applied to a formula and a sequence of elements of the linear order, will determine whether or not is true in the structure. A linear order is decidable if the relations defined by all formulas are uniformly computable. These definitions suggest two questions. Are there, for each , -decidable linear orders that are (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  23
    On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders.Rodney G. Downey & Michael F. Moses - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):237-246.
  6.  18
    Recursive Categoricity and Recursive Stability.John N. Crossley, Alfred B. Manaster & Michael F. Moses - 1986 - Annals of Pure and Applied Logic 31:191-204.
  7.  12
    On Choice Sets and Strongly Non‐Trivial Self‐Embeddings of Recursive Linear Orders.Rodney G. Downey & Michael F. Moses - 1989 - Mathematical Logic Quarterly 35 (3):237-246.
  8.  23
    The Structure of the Honest Polynomial M-Degrees.Rod Downey, William Gasarch & Michael Moses - 1994 - Annals of Pure and Applied Logic 70 (2):113-139.
    We prove a number of structural theorems about the honest polynomial m-degrees contingent on the assumption P = NP . In particular, we show that if P = NP , then the topped finite initial segments of Hm are exactly the topped finite distributive lattices, the topped initial segments of Hm are exactly the direct limits of ascending sequences of finite distributive lattices, and all recursively presentable distributive lattices are initial segments of Hm ∩ RE. Additionally, assuming ¦∑¦ = 1, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  9.  26
    The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
    The block relation B(x,y) in a linear order is satisfied by elements that are finitely far apart; a block is an equivalence class under this relation. We show that every computable linear order with dense condensation-type (i.e., a dense collection of blocks) but no infinite, strongly η-like interval (i.e., with all blocks of size less than some fixed, finite k ) has a computable copy with the nonblock relation ¬ B(x,y) computably enumerable. This implies that every computable linear order has (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark