Algebraic and Turing separability of rings (Q1814984): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Dumitru Buşneag / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Dumitru Buşneag / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jabr.1996.0323 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035752609 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:49, 19 March 2024

scientific article
Language Label Description Also known as
English
Algebraic and Turing separability of rings
scientific article

    Statements

    Algebraic and Turing separability of rings (English)
    0 references
    24 April 1997
    0 references
    A weak presentation of a countable field/ring \(F\) is an injective homomorphism from \(F\) into a field/ring whose universe is \(\mathbb{N}\) such that all the field/ring operations are translated by total recursive functions. Given two recursive integral domains \(R_1\) and \(R_2\) with quotient field \(F_1\) and \(F_2\) respectively, in this paper the author investigates under what circumstances there exists a weak presentation of the field \(F_1F_2\) such that the images of \(R_1\) and \(R_2\) belong to two different recursively enumerable (r.e.) Turing degrees. Finally the author show that \(\mathbb{Q}\) has an r.e. weak presentation as a ring which is not a weak presentation of \(\mathbb{Q}\) as a field.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Turing separability of rings
    0 references
    weak presentation of field rings
    0 references
    recursively enumerable Turing degrees
    0 references
    total recursive functions
    0 references
    0 references