Related papers: On optimal Scott sentences of finitely generated a…
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…
We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…
Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…
This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $\tau$, and use them to give…
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
The ultraproduct construction is generalized to $p$-ultramean constructions ($1\leqslant p<\infty$) by replacing ultrafilters with finitely additive measures. These constructions correspond to the linear fragments $\mathscr L^p$ of…
We study the possibility of applying a finite-dimensionality argument in order to address parts of the Baum-Connes conjecture for finitely generated linear groups. This gives an alternative approach to the results of Guentner, Higson, and…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
In 1976 S. Eilenberg and M.-P. Sch\"{u}tzenberger posed the following diabolical question: if $\mathbf{A}$ is a finite algebraic structure, $\Sigma$ is the set of all identities true in $\mathbf{A}$, and there exists a finite subset $F$ of…
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We establish an approximate zero-one law for sentences of continuous logic over finite metric spaces of diameter at most $1$. More precisely, we axiomatize a complete metric theory $T_{\mathrm{as}}$ such that, given any sentence $\sigma$ in…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…
We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…
Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…