Related papers: Interpreting the weak monadic second order theory …
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
The paper is a short survey of recent developments in the area of first order descriptions of linear groups. It is aimed to illuminate the known results and to pose the new problems relevant to logical characterizations of Chevalley groups…
Second-order automorphic forms are similar to the usual automorphic forms but have a weaker automorphy condition. We answer a question of Zagier and find the dimensions of spaces of holomorphic, even weight, second-order forms. We also…
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set…
The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…
Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…
This is the second introductory paper concerning structures called rootoids and protorootoids, the definition of which is abstracted from formal properties of Coxeter groups with their root systems and weak orders. The ubiquity of…
This paper proves two results on the field of rationality $\Q(\pi)$ for an automorphic representation $\pi$, which is the subfield of $\C$ fixed under the subgroup of $\Aut(\C)$ stabilizing the isomorphism class of the finite part of $\pi$.…
We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…
The paper focuses on the structure of fundamental sequences of ordinals smaller than $\epsilon_0$. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for…
We prove that groups of the form $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$, where $m,n \in \mathbb N$, are regularly bi-interpretable with $\mathbb Z$ and therefore are first-order rigid: every finitely generated group elementarily equivalent…
Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational…
We perform conformal perturbation theory by marginal operators to first order. A suitable renormalization method is needed that makes the conformal invariance of the deformed correlation functions manifest. Combining the embedding space…
In this paper, we have computed the automorphism groups of all groups of order $p^{2}q^{2}$, where $p$ and $q$ are distinct primes.