Does weak quasi-o-minimality behave better than weak o-minimality? (Q2118170)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Does weak quasi-o-minimality behave better than weak o-minimality? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
0.8132370710372925
0 references
0.7731609344482422
0 references
0.767323911190033
0 references
0.762694239616394
0 references
