Related papers: There is no maximal decidable expansion of the $\l…
We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the…
We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…
A proper elementary extension of a model is called small if it realizes no new types over any finite set in the base model. We answer a question of Marker, and show that it is possible to have an o-minimal structure with a maximal small…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…
We establish the decidability of the $\Sigma_2$ theory of $\mathscr{D}_h(\leq_h \mathcal{O})$, the hyperarithmetic degrees below Kleene's $\mathcal{O}$, in the language of uppersemilattices with least and greatest element. This requires a…
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…
We apply the Principle of Maximum Entropy to the study of a general class of deterministic fractal sets. The scaling laws peculiar to these objects are accounted for by means of a constraint concerning the average content of information in…
Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…
The following two assertions are equivalent for an o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous…
We prove the following theorem: let $\widetilde{\mathcal R}$ be an expansion of the real field $\overline{\mathbb R}$, such that every definable set (I) is a uniform countable union of semialgebraic sets, and (II) contains a "semialgebraic…
A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement $\phi$ in some axiomatic system $T$, one looks for minimal subsystems of $T$ that allow deriving $\phi$. In…
We establish the first global results for groups definable in tame expansions of o-minimal structures. Let $\mathcal N$ be an expansion of an o-minimal structure $\mathcal M$ that admits a good dimension theory. The setting includes dense…
We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…
We prove a dichotomy for o-minimal fields $\mathcal{R}$, expanded by a $T$-convex valuation ring (where $T$ is the theory of $\mathcal{R}$) and a compatible monomial group. We show that if $T$ is power bounded, then this expansion of…