Switch to: References

Add citations

You must login to add citations.
  1. Definability and decidability in infinite algebraic extensions.Alexandra Shlapentokh & Carlos Videla - 2014 - Annals of Pure and Applied Logic 165 (7-8):1243-1262.
    We use a generalization of a construction by Ziegler to show that for any field F and any countable collection of countable subsets Ai⊆FAi⊆F, i∈I⊂Z>0i∈I⊂Z>0 there exist infinitely many fields K of arbitrary greater than one transcendence degree over F and of infinite algebraic degree such that each AiAi is first-order definable over K. We also use the construction to show that many infinitely axiomatizable theories of fields which are not compatible with the theory of algebraically closed fields are finitely (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On the elimination of imaginaries from certain valued fields.Philip Scowcroft & Angus Macintyre - 1993 - Annals of Pure and Applied Logic 61 (3):241-276.
    A nontrivial ring with unit eliminates imaginaries just in case its complete theory has the following property: every definable m-ary equivalence relation E may be defined by a formula f = f, where f is an m-ary definable function. We show that for certain natural expansions of the field of p-adic numbers, elimination of imaginaries fails or is independent of ZPC. Similar results hold for certain fields of formal power series.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the elementary theory of Banach algebras.Angus Macintyre - 1971 - Annals of Mathematical Logic 3 (3):239.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rings of monoids elementarily equivalent to polynomial rings.Gérard Leloup - 1994 - Annals of Pure and Applied Logic 68 (2):173-180.
    Let l be a commutative field; Bauval [1] showed that the theory of the ring l[X1,...,Xm] is the same as the weak second-order theory of the field l. Now, l[X1,...,Xm] is the ring of the monoid m, so it may be asked what properties of m we can deduce from the theory of l[;m], that is, if l[m] is elementarily equivalent to the ring of monoid k[G], with k, a field and G, a monoid, what do we know not only (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Decidability questions for a ring of Laurent polynomials.Alla Sirokofskich - 2012 - Annals of Pure and Applied Logic 163 (5):615-619.
    Download  
     
    Export citation  
     
    Bookmark