Does weak quasi-o-minimality behave better than weak o-minimality? (Q2118170): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164911541 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.05228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-o-minimal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly o-minimal structures and real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dedekind Completeness and the Algebraic Complexity of o-Minimal Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationarily ordered types and the number of countable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON LINEARLY ORDERED STRUCTURES OF FINITE RANK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definably extending partial orders in totally ordered structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dp-minimal ordered structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: AROUND RUBIN’S “THEORIES OF LINEAR ORDER” / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:46, 28 July 2024

scientific article
Language Label Description Also known as
English
Does weak quasi-o-minimality behave better than weak o-minimality?
scientific article

    Statements

    Does weak quasi-o-minimality behave better than weak o-minimality? (English)
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    The present paper concerns studying the notion of weak quasi-o-minimality. The authors studies properties of definable linear orders in weakly quasi-o-minimal theories and proves that the weak quasi-o-minimality does not depend on the choice of a definable linear order. They also prove a weak version of the monotonicity theorem.
    0 references
    o-minimality
    0 references
    weak o-minimality
    0 references
    quasi-o-minimality
    0 references
    binary reduct
    0 references
    monotone relation
    0 references
    definable order relation
    0 references
    quantifier elimination
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references