Parameterized stratification and piece number of D-semianalytic sets

Y. Firat Celikler

Home/Archive/arXiv

arXiv · math/0409095

Parameterized stratification and piece number of D-semianalytic sets

Y. Firat Celikler

View original source ↗Read source document ↗Export metadata ↓

Abstract

We obtain results on the geometry of D-semianalytic and subanalytic subsets over a complete, non-trivially valued non-Archimedean field K, which is not necessarily algebraically closed. Among the results are a parameterized smooth stratification theorem and several results concerning the dimension of the D-semianalytic and subanalytic sets. We also extend Bartenwerfer's definition of piece number for analytic K-varieties to D-semianalytic sets and prove the existence of a uniform bound for the piece number of the fibers of a D-semianalytic set. We also establish a connection between the piece number and complexity of D-semianalytic sets which are subsets of the line and thereby give a simpler proof of the Complexity Theorem of Lipshitz and Robinson. We finish by proving that for each D-semianalytic X, there is a semialgebraic Y such that one dimensional fibers of X are among the one dimensional fibers of Y. This is an analogue of a theorem by van den Dries, Haskell and Macpherson.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Y. Firat Celikler. 2004-09-07. Parameterized stratification and piece number of D-semianalytic sets. https://arxiv.org/abs/math/0409095

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗