Semilinear cell decomposition

1994 ◽  
Vol 59 (1) ◽  
pp. 199-208 ◽  
Author(s):  
Nianzheng Liu
Keyword(s):  
Decomposition Theorem ◽  
Cell Decomposition ◽  
Scalar Multiplication ◽  
Unary Predicate

AbstractWe obtain a p-adic semilinear cell decomposition theorem using methods developed by Denef in [Journal für die Reine und Angewandte Mathematik, vol. 369 (1986), pp. 154–166]. We also prove that any set definable with quantifiers in (0,1, +, —, λq, Pn){n∈ℕ,q∈ℚp} may be defined without quantifiers, where λq is scalar multiplication by q and Pn is a unary predicate which denotes the nonzero nth powers in the p-adic field ℚp. Such a set is called a p-adic semilinear set in this paper. Some further considerations are discussed in the last section.

scholarly journals CELL DECOMPOSITION AND CLASSIFICATION OF DEFINABLE SETS INp-OPTIMAL FIELDS

2017 ◽  
Vol 82 (1) ◽  
pp. 120-136 ◽  
Author(s):  
LUCK DARNIÈRE ◽  
IMMANUEL HALPUCZOK
Keyword(s):  
Decomposition Theorem ◽  
Cell Decomposition ◽  
Extreme Value ◽  
Property A ◽  
Definable Subset ◽  
Skolem Functions ◽  
Definable Sets ◽  
A Cell ◽  
Preparation Theorem ◽  
Definable Functions

AbstractWe prove that forp-optimal fields (a very large subclass ofp-minimal fields containing all the known examples) a cell decomposition theorem follows from methods going back to Denef’s paper [7]. We derive from it the existence of definable Skolem functions and strongp-minimality. Then we turn to stronglyp-minimal fields satisfying the Extreme Value Property—a property which in particular holds in fields which are elementarily equivalent to ap-adic one. For such fieldsK, we prove that every definable subset ofK×Kdwhose fibers overKare inverse images by the valuation of subsets of the value group is semialgebraic. Combining the two we get a preparation theorem for definable functions onp-optimal fields satisfying the Extreme Value Property, from which it follows that infinite sets definable over such fields are in definable bijection iff they have the same dimension.

scholarly journals Presburger sets and p-minimal fields

2003 ◽  
Vol 68 (1) ◽  
pp. 153-162 ◽  
Author(s):  
Raf Cluckers
Keyword(s):  
Decomposition Theorem ◽  
Cell Decomposition ◽  
Dimension Theory ◽  
Definable Sets ◽  
A Cell ◽  
Tight Connection ◽  
Full Classification

AbstractWe prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable bijection. We also exhibit a tight connection between the definable sets in an arbitrary p-minimal field and Presburger sets in its value group. We give a negative result about expansions of Presburger structures and prove uniform elimination of imaginaries for Presburger structures within the Presburger language.

Analytic cell decomposition and the closure of p-adic semianalytic sets

1997 ◽  
Vol 62 (1) ◽  
pp. 285-303
Author(s):  
Nianzheng Liu
Keyword(s):  
Analytic Function ◽  
Quantifier Elimination ◽  
Decomposition Theorem ◽  
Cell Decomposition ◽  
Closure Property ◽  
Basic Properties ◽  
Analogous Property ◽  
Subanalytic Sets ◽  
Weierstrass Preparation ◽  
Preparation Theorem

The p-adic semianalytic sets are defined, locally, as boolean combinations of sets of the form over the p-adic fields ℚp, where f is an analytic function. A well-know example due to Osgood showed the projection of a semianalytic set need not be a semianalytic set. We call those sets that are, locally, the projections of p-adic semianalytic sets p-adic subanalytic sets. The theory of p-adic subanalytic sets was presented by Denef and Van den Dries in [5]. The basic tools are the quantifier elimination techniques together with the ultrametric Weierstrass Preparation Theorem. Simultaneously with their developments of the p-adic subanalytic sets, they established some basic properties of p-adic semianalytic sets.In this paper, we prove that the closure of any p-adic semianalytic set is also a semianalytic set. The analogous property for real semianalytic sets was proved in [12] and that for rigid semianalytic sets, informed by the referee, has been proved recently by a quite different method in [14] (cf. [9]). The keys to the proof are a separation lemma (Lemma 2) and an analytic cell decomposition theorem (Theorem 2) which is an analytic version of Denef's cell decomposition theorem (see [3, 4]; A total different form of anayltic cells appeared in [13]). The analytic cell decomposition theorem allows us to partition certain kinds of basic subsets into analytic cells that possess the closure property (see §1 for the definition).

scholarly journals o-MINIMAL COHOMOLOGY: FINITENESS AND INVARIANCE RESULTS

2009 ◽  
Vol 09 (02) ◽  
pp. 167-182 ◽  
Author(s):  
ALESSANDRO BERARDUCCI ◽  
ANTONGIULIO FORNASIERO
Keyword(s):  
Betti Numbers ◽  
Decomposition Theorem ◽  
Cell Decomposition ◽  
Compact Set ◽  
Cohomology Groups ◽  
Finitely Generated ◽  
Minimal Cell ◽  
General Validity ◽  
Cw Complex ◽  
Definable Sets

The topology of definable sets in an o-minimal expansion of a group is not fully understood due to the lack of a triangulation theorem. Despite the general validity of the cell decomposition theorem, we do not know whether any definably compact set is a definable CW-complex. Moreover the closure of an o-minimal cell can have arbitrarily high Betti numbers. Nevertheless we prove that the cohomology groups of a definably compact set over an o-minimal expansion of a group are finitely generated and invariant under elementary extensions and expansions of the language.

b-MINIMALITY

2007 ◽  
Vol 07 (02) ◽  
pp. 195-227 ◽  
Author(s):  
RAF CLUCKERS ◽  
FRANÇOIS LOESER
Keyword(s):  
Characteristic Zero ◽  
Decomposition Theorem ◽  
Cell Decomposition ◽  
Dimension Theory ◽  
Minimal Cell ◽  
Euler Characteristics ◽  
Valued Fields ◽  
Henselian Valued Fields ◽  
A Cell ◽  
Abstract Notion

We introduce a new notion of tame geometry for structures admitting an abstract notion of balls. The notion is named b-minimality and is based on definable families of points and balls. We develop a dimension theory and prove a cell decomposition theorem for b-minimal structures. We show that b-minimality applies to the theory of Henselian valued fields of characteristic zero, generalizing work by Denef–Pas [25, 26]. Structures which are o-minimal, v-minimal, or p-minimal and which satisfy some slight extra conditions are also b-minimal, but b-minimality leaves more room for nontrivial expansions. The b-minimal setting is intended to be a natural framework for the construction of Euler characteristics and motivic or p-adic integrals. The b-minimal cell decomposition is a generalization of concepts of Cohen [11], Denef [15], and the link between cell decomposition and integration was first made by Denef [13].

scholarly journals Dynamic Łukasiewicz logic and its application to immune system

2021 ◽  
Author(s):  
Antonio Di Nola ◽  
Revaz Grigolia ◽  
Nunu Mitskevich ◽  
Gaetano Vitale
Keyword(s):  
Immune System ◽  
Scalar Multiplication ◽  
Kripke Semantics ◽  
Łukasiewicz Logic ◽  
Lukasiewicz Logic ◽  
Regular Algebras

AbstractIt is introduced an immune dynamic n-valued Łukasiewicz logic $$ID{\L }_n$$ I D Ł n on the base of n-valued Łukasiewicz logic $${\L }_n$$ Ł n and corresponding to it immune dynamic $$MV_n$$ M V n -algebra ($$IDL_n$$ I D L n -algebra), $$1< n < \omega $$ 1 < n < ω , which are algebraic counterparts of the logic, that in turn represent two-sorted algebras $$(\mathcal {M}, \mathcal {R}, \Diamond )$$ ( M , R , ◊ ) that combine the varieties of $$MV_n$$ M V n -algebras $$\mathcal {M} = (M, \oplus , \odot , \sim , 0,1)$$ M = ( M , ⊕ , ⊙ , ∼ , 0 , 1 ) and regular algebras $$\mathcal {R} = (R,\cup , ;, ^*)$$ R = ( R , ∪ , ; , ∗ ) into a single finitely axiomatized variety resembling R-module with “scalar” multiplication $$\Diamond $$ ◊ . Kripke semantics is developed for immune dynamic Łukasiewicz logic $$ID{\L }_n$$ I D Ł n with application in immune system.

Sign in / Sign up

Export Citation Format

Share Document