722,760 research outputs found
Transforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite
sets interpretations. Those interpretations are defined by weak monadic
second-order (WMSO) formulas with free set variables. They transform a given
structure into a structure with a domain consisting of finite sets of elements
of the orignal structure. The definition of these interpretations directly
implies that they send structures with a decidable WMSO theory to structures
with a decidable first-order theory. In this paper, we investigate the
expressive power of such interpretations applied to infinite deterministic
trees. The results can be used in the study of automatic and tree-automatic
structures.Comment: 36 page
Generalized Indiscernibles as Model-complete Theories
We give an almost entirely model-theoretic account of both Ramsey classes of
finite structures and of generalized indiscernibles as studied in special cases
in (for example) [7], [9]. We understand "theories of indiscernibles" to be
special kinds of companionable theories of finite structures, and much of the
work in our arguments is carried in the context of the model-companion. Among
other things, this approach allows us to prove that the companion of a theory
of indiscernibles whose "base" consists of the quantifier-free formulas is
necessarily the theory of the Fraisse limit of a Fraisse class of linearly
ordered finite structures (where the linear order will be at least
quantifier-free definable). We also provide streamlined arguments for the
result of [6] identifying extremely amenable groups with the automorphism
groups of limits of Ramsey classes.Comment: 21 page
Tameness in least fixed-point logic and McColm's conjecture
We investigate four model-theoretic tameness properties in the context of
least fixed-point logic over a family of finite structures. We find that each
of these properties depends only on the elementary (i.e., first-order) limit
theory, and we completely determine the valid entailments among them. In
contrast to the context of first-order logic on arbitrary structures, the order
property and independence property are equivalent in this setting. McColm
conjectured that least fixed-point definability collapses to first-order
definability exactly when proficiency fails. McColm's conjecture is known to be
false in general. However, we show that McColm's conjecture is true for any
family of finite structures whose limit theory is model-theoretically tame
Pseudofinite structures and simplicity
We explore a notion of pseudofinite dimension, introduced by Hrushovski and
Wagner, on an infinite ultraproduct of finite structures. Certain conditions on
pseudofinite dimension are identified that guarantee simplicity or
supersimplicity of the underlying theory, and that a drop in pseudofinite
dimension is equivalent to forking. Under a suitable assumption, a
measure-theoretic condition is shown to be equivalent to local stability. Many
examples are explored, including vector spaces over finite fields viewed as
2-sorted finite structures, and homocyclic groups. Connections are made to
products of sets in finite groups, in particular to word maps, and a
generalization of Tao's algebraic regularity lemma is noted
A state of a dynamic computational structure distributed in an environment: a model and its corollaries
Currently there is great interest in computational models consisting of
underlying regular computational environments, and built on them distributed
computational structures. Examples of such models are cellular automata,
spatial computation and space-time crystallography. For any computational model
it is natural to define a functional equivalence of different but related
computational structures. In the finite automata theory an example of such
equivalence is automata homomorphism and, in particular, automata isomorphism.
If we continue to stick to the finite automata theory, a fundamental question
arise, what a state of a distributed computational structure is. This work is
devoted to particular solution of the issue.Comment: 11 pages, 5 figure
- …