Type-preserving formulas in weakly o-minimal theories

2025

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.33048/semi.2025.22.020
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In the present paper we study properties of p-preserving convex-to-right (left) formulas in weakly o-minimal theories, where p is a non-algebraic 1-type.It is proved that in the case of an existence of a p-preserving convex-to-right (left) formula that is not equivalence-generating, there exists a p-preserving convex-toleft (right) formula that is also not equivalence-generating; it was shown how it is built from the original formula.