Related papers: On Infinite Real Trace Rational Languages of Maxim…
We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
Groups of almost upper triangular infinite matrices with entries indexed by integers are studied. It is shown that, when the matrices are over a finite field, these groups admit a nondiscrete totally disconnected, locally compact group…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
Reasoning in language models is difficult to evaluate: natural-language traces are unverifiable, symbolic datasets are too small, and most benchmarks conflate heuristics with inference. We present FOL-Traces, the first large-scale dataset…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…
The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We…
We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
By virtue of linguistic compositionality, few syntactic rules and a finite lexicon can generate an unbounded number of sentences. That is, language, though seemingly high-dimensional, can be explained using relatively few degrees of…
Let X be a complex projective manifold and f a dominating rational map from X onto X. We show that the topological entropy h(f) of f is bounded from above by the logarithm of its maximal dynamical degree.
Hyperproperties lift conventional trace-based languages from a set of execution traces to a set of sets of executions. From a formal-language perspective, these are sets of sets of words, namely hyperlanguages. Hyperautomata are based on…
Let $\Gamma$ be the fundamental group of a manifold modeled on three dimensional Sol geometry. We prove that $\Gamma$ has a finite index subgroup $G$ which has a rational growth series with respect to a natural generating set. We do this by…
We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined…
Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…