1,998 research outputs found

    Π10 classes and orderable groups

    Get PDF
    AbstractIt is known that the spaces of orders on orderable computable fields can represent all Π10 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π10 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computable presentation admits a computable set of representatives for its Archimedean classes

    Independence in computable algebra

    Full text link
    We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and difference closed fields with the relevant notions of independence. To cover these classes of structures we introduce a new technique of safe extensions that was not necessary for the previously known results of this kind. We will then apply our techniques to derive new corollaries on the number of computable presentations of these structures. The condition also implies classical and new results on vector spaces, algebraically closed fields, torsion-free abelian groups and Archimedean ordered abelian groups.Comment: 24 page

    Representing Scott sets in algebraic settings

    Get PDF
    We prove that for every Scott set SS there are SS-saturated real closed fields and models of Presburger arithmetic

    Real closed exponential fields

    Full text link
    In an extended abstract Ressayre considered real closed exponential fields and integer parts that respect the exponential function. He outlined a proof that every real closed exponential field has an exponential integer part. In the present paper, we give a detailed account of Ressayre's construction, which becomes canonical once we fix the real closed exponential field, a residue field section, and a well ordering of the field. The procedure is constructible over these objects; each step looks effective, but may require many steps. We produce an example of an exponential field RR with a residue field kk and a well ordering << such that Dc(R)D^c(R) is low and kk and << are Δ30\Delta^0_3, and Ressayre's construction cannot be completed in Lω1CKL_{\omega_1^{CK}}.Comment: 24 page
    • …
    corecore