Isomorphism theorem for BSS recursively enumerable sets over real closed fields (Q1575912): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alfred Tarski's elimination theory for real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination of quantifiers in algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on real structural complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism theorem for BSS recursively enumerable sets over real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function / rank
 
Normal rank

Latest revision as of 13:15, 30 May 2024

scientific article
Language Label Description Also known as
English
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
scientific article

    Statements