Switch to: References

Add citations

You must login to add citations.
  1. The diophantine problem for addition and divisibility over subrings of the rationals.Leonidas Cerda-Romero & Carlos Martinez-Ranero - 2017 - Journal of Symbolic Logic 82 (3):1140-1149.
    It is shown that the positive existential theory of the structure, where S is a nonempty finite set of prime numbers, is undecidable. This result should be put in contrast with the fact that the positive existential theory of is decidable.
    Download  
     
    Export citation  
     
    Bookmark  
  • Uniform definability of integers in reduced indecomposable polynomial rings.Marco Barone, Nicolás Caro & Eudes Naziazeno - 2020 - Journal of Symbolic Logic 85 (4):1376-1402.
    We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with signature $$. In the characteristic zero case, the claim implies that the full theory is undecidable, for rings of the referred type. This extends a series of results by Raphael Robinson, holding for certain polynomial integral domains, to a more general class.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Undecidability of indecomposable polynomial rings.Marco Barone, Nicolás Caro-Montoya & Eudes Naziazeno - forthcoming - Archive for Mathematical Logic:1-19.
    By using algebraic properties of (commutative unital) indecomposable polynomial rings we achieve results concerning their first-order theory, namely: interpretability of arithmetic and a uniform proof of undecidability of their full theory, both in the language of rings without parameters. This vastly extends the scope of a method due to Raphael Robinson, which deals with a restricted class of polynomial integral domains.
    Download  
     
    Export citation  
     
    Bookmark