Approximate Euler characteristic, dimension, and weak pigeonhole principles

2004 ◽  
Vol 69 (1) ◽  
pp. 201-214
Author(s):  
Jan Krajíček
Keyword(s):  
Euler Characteristic ◽  
Characteristic Dimension ◽  
Order Structure ◽  
Dimension Function ◽  
Pigeonhole Principle ◽  
First Order ◽  
Definable Set ◽  
Definable Sets

AbstractWe define the notion of approximate Euler characteristic of definable sets of a first order structure. We show that a structure admits a non-trivial approximate Euler characteristic if it satisfies weak pigeonhole principle : two disjoint copies of a non-empty definable set A cannot be definably embedded into A, and principle CC of comparing cardinalities: for any two definable sets A, B either A definably embeds in B or vice versa. Also, a structure admitting a non-trivial approximate Euler characteristic must satisfy .Further we show that a structure admits a non-trivial dimension function on definable sets if and only if it satisfies weak pigeonhole principle : for no definable set A with more than one element can A2 definably embed into A.

Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings

2000 ◽  
Vol 6 (3) ◽  
pp. 311-330 ◽  
Author(s):  
Jan Krajíček ◽  
Thomas Scanlon
Keyword(s):  
Euler Characteristic ◽  
Order Structure ◽  
Euler Characteristics ◽  
Grothendieck Ring ◽  
Open Problems ◽  
Partially Ordered ◽  
Counting Functions ◽  
Finite Structures ◽  
Definable Sets ◽  
Grothendieck Rings

AbstractWe recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially ordered Euler characteristic and Grothendieck ring and give a characterization of structures that have non-trivial partially ordered Grothendieck ring. We give a generalization of counting functions to locally finite structures, and use the construction to show that the Grothendieck ring of the complex numbers contains as a subring the ring of integer polynomials in continuum many variables. We prove the existence of a universal strong Euler characteristic on a structure. We investigate the dependence of the Grothendieck ring on the theory of the structure and give a few counter-examples. Finally, we relate some open problems and independence results in bounded arithmetic to properties of particular Grothendieck rings.

First order topological structures and theories

1987 ◽  
Vol 52 (3) ◽  
pp. 763-778 ◽  
Author(s):  
Anand Pillay
Keyword(s):  
Topological Structure ◽  
Complex Numbers ◽  
Restricted Class ◽  
Real Numbers ◽  
Boolean Combination ◽  
Topological Structures ◽  
First Order ◽  
Definable Set ◽  
Material Basis ◽  
Definable Sets

In this paper we introduce the notion of a first order topological structure, and consider various possible conditions on the complexity of the definable sets in such a structure, drawing several consequences thereof.Our aim is to develop, for a restricted class of unstable theories, results analogous to those for stable theories. The “material basis” for such an endeavor is the analogy between the field of real numbers and the field of complex numbers, the former being a “nicely behaved” unstable structure and the latter the archetypal stable structure. In this sense we try here to situate our work on o-minimal structures [PS] in a general topological context. Note, however, that the p-adic numbers, and structures definable therein, will also fit into our analysis.In the remainder of this section we discuss several ways of studying topological structures model-theoretically. Eventually we fix on the notion of a structure in which the topology is “explicitly definable” in the sense of Flum and Ziegler [FZ]. In §2 we introduce the hypothesis that every definable set is a Boolean combination of definable open sets. In §3 we introduce a “dimension rank” on (closed) definable sets. In §4 we consider structures on which this rank is defined, and for which also every definable set has a finite number of definably connected definable components. We show that prime models over sets exist under such conditions.

Some remarks on definable equivalence relations in O-minimal structures

1986 ◽  
Vol 51 (3) ◽  
pp. 709-714 ◽  
Author(s):  
Anand Pillay
Keyword(s):  
Equivalence Relation ◽  
Linear Order ◽  
Finite Union ◽  
Equivalence Relations ◽  
Complete Theory ◽  
First Order ◽  
Definable Set ◽  
Order Language ◽  
Minimal Structure ◽  
Definable Sets

Let M be an O-minimal structure. We use our understanding, acquired in [KPS], of the structure of definable sets of n-tuples in M, to study definable (in M) equivalence relations on Mn. In particular, we show that if E is an A-definable equivalence relation on Mn (A ⊂ M) then E has only finitely many classes with nonempty interior in Mn, each such class being moreover also A-definable. As a consequence, we are able to give some conditions under which an O-minimal theory T eliminates imaginaries (in the sense of Poizat [P]).If L is a first order language and M an L-structure, then by a definable set in M, we mean something of the form X ⊂ Mn, n ≥ 1, where X = {(a1…,an) ∈ Mn: M ⊨ϕ(ā)} for some formula ∈ L(M). (Here L(M) means L together with names for the elements of M.) If the parameters from come from a subset A of M, we say that X is A-definable.M is said to be O-minimal if M = (M, <,…), where < is a dense linear order with no first or last element, and every definable set X ⊂ M is a finite union of points, and intervals (a, b) (where a, b ∈ M ∪ {± ∞}). (This notion is as in [PS] except here we demand the underlying order be dense.) The complete theory T is said to be O-minimal if every model of T is O-minimal. (Note that in [KPS] it is proved that if M is O-minimal, then T = Th(M) is O-minimal.) In the remainder of this section and in §2, M will denote a fixed but arbitrary O-minimal structure. A,B,C,… will denote subsets of M.

Preliminaries

2017 ◽  
Author(s):  
Ehud Hrushovski ◽  
François Loeser
Keyword(s):  
Valued Fields ◽  
Definable Set ◽  
Valued Field ◽  
Galois Coverings ◽  
Definable Type ◽  
Definable Sets ◽  
Background Material

This chapter provides some background material on definable sets, definable types, orthogonality to a definable set, and stable domination, especially in the valued field context. It considers more specifically these concepts in the framework of the theory ACVF of algebraically closed valued fields and describes the definable types concentrating on a stable definable V as an ind-definable set. It also proves a key result that demonstrates definable types as integrals of stably dominated types along some definable type on the value group sort. Finally, it discusses the notion of pseudo-Galois coverings. Every nonempty definable set over an algebraically closed substructure of a model of ACVF extends to a definable type.

μ-definable sets of integers

1993 ◽  
Vol 58 (1) ◽  
pp. 291-313 ◽  
Author(s):  
Robert S. Lubarsky
Keyword(s):  
Fixed Point ◽  
Free Variable ◽  
Order Logic ◽  
First Order Logic ◽  
Inductive Definition ◽  
Natural Class ◽  
First Order ◽  
Inductive Definitions ◽  
Definable Sets ◽  
The Universe

Inductive definability has been studied for some time already. Nonetheless, there are some simple questions that seem to have been overlooked. In particular, there is the problem of the expressibility of the μ-calculus.The μ-calculus originated with Scott and DeBakker [SD] and was developed by Hitchcock and Park [HP], Park [Pa], Kozen [K], and others. It is a language for including inductive definitions with first-order logic. One can think of a formula in first-order logic (with one free variable) as defining a subset of the universe, the set of elements that make it true. Then “and” corresponds to intersection, “or” to union, and “not” to complementation. Viewing the standard connectives as operations on sets, there is no reason not to include one more: least fixed point.There are certain features of the μ-calculus coming from its being a language that make it interesting. A natural class of inductive definitions are those that are monotone: if X ⊃ Y then Γ (X) ⊃ Γ (Y) (where Γ (X) is the result of one application of the operator Γ to the set X). When studying monotonic operations in the context of a language, one would need a syntactic guarantor of monotonicity. This is provided by the notion of positivity. An occurrence of a set variable S is positive if that occurrence is in the scopes of exactly an even number of negations (the antecedent of a conditional counting as a negation). S is positive in a formula ϕ if each occurrence of S is positive. Intuitively, the formula can ask whether x ∊ S, but not whether x ∉ S. Such a ϕ can be considered an inductive definition: Γ (X) = {x ∣ ϕ(x), where the variable S is interpreted as X}. Moreover, this induction is monotone: as X gets bigger, ϕ can become only more true, by the positivity of S in ϕ. So in the μ-calculus, a formula is well formed by definition only if all of its inductive definitions are positive, in order to guarantee that all inductive definitions are monotone.

scholarly journals Some questions concerning minimal structures

2007 ◽  
pp. 79-83
Author(s):  
Predrag Tanovic
Keyword(s):  
Order Structure ◽  
First Order ◽  
Definable Subset

An infinite first-order structure is minimal if its each definable subset is either finite or co-finite. We formulate three questions concerning order properties of minimal structures which are motivated by Pillay?s Conjecture (stating that a countable first-order structure must have infinitely many countable, pairwise non-isomorphic elementary extensions).

scholarly journals Impact of higher order network structure on emergent cortical activity

2020 ◽  
Vol 4 (1) ◽  
pp. 292-314 ◽  
Author(s):  
Max Nolte ◽  
Eyal Gal ◽  
Henry Markram ◽  
Michael W. Reimann
Keyword(s):  
Network Structure ◽  
Morphological Diversity ◽  
Cortical Activity ◽  
Higher Order ◽  
Neuronal Firing ◽  
Network Activity ◽  
Synaptic Connectivity ◽  
Order Structure ◽  
First Order ◽  
Neuronal Types

Synaptic connectivity between neocortical neurons is highly structured. The network structure of synaptic connectivity includes first-order properties that can be described by pairwise statistics, such as strengths of connections between different neuron types and distance-dependent connectivity, and higher order properties, such as an abundance of cliques of all-to-all connected neurons. The relative impact of first- and higher order structure on emergent cortical network activity is unknown. Here, we compare network structure and emergent activity in two neocortical microcircuit models with different synaptic connectivity. Both models have a similar first-order structure, but only one model includes higher order structure arising from morphological diversity within neuronal types. We find that such morphological diversity leads to more heterogeneous degree distributions, increases the number of cliques, and contributes to a small-world topology. The increase in higher order network structure is accompanied by more nuanced changes in neuronal firing patterns, such as an increased dependence of pairwise correlations on the positions of neurons in cliques. Our study shows that circuit models with very similar first-order structure of synaptic connectivity can have a drastically different higher order network structure, and suggests that the higher order structure imposed by morphological diversity within neuronal types has an impact on emergent cortical activity.

An axiomatization of the logic with the rough quantifier

1991 ◽  
Vol 56 (2) ◽  
pp. 608-617 ◽  
Author(s):  
Michał Krynicki ◽  
Hans-Peter Tuschik
Keyword(s):  
Equivalence Relation ◽  
Equivalence Relations ◽  
Order Structure ◽  
Partition Model ◽  
Weak Model ◽  
First Order ◽  
Basic Properties ◽  
Generalized Quantifier ◽  
Order Language ◽  
The Right

We consider the language L(Q), where L is a countable first-order language and Q is an additional generalized quantifier. A weak model for L(Q) is a pair 〈, q〉 where is a first-order structure for L and q is a family of subsets of its universe. In case that q is the set of classes of some equivalence relation the weak model 〈, q〉 is called a partition model. The interpretation of Q in partition models was studied by Szczerba [3], who was inspired by Pawlak's paper [2]. The corresponding set of tautologies in L(Q) is called rough logic. In the following we will give a set of axioms of rough logic and prove its completeness. Rough logic is designed for creating partition models.The partition models are the weak models arising from equivalence relations. For the basic properties of the logic of weak models the reader is referred to Keisler's paper [1]. In a weak model 〈, q〉 the formulas of L(Q) are interpreted as usual with the additional clause for the quantifier Q: 〈, q〉 ⊨ Qx φ(x) iff there is some X ∊ q such that 〈, q〉 ⊨ φ(a) for all a ∊ X.In case X satisfies the right side of the above equivalence we say that X is contained in φ(x) or, equivalently, φ(x) contains X.

Sign in / Sign up

Export Citation Format

Share Document