English
Related papers

Related papers: A Topological proof that $O_2$ is $2$-MCFL

200 papers

Assuming the absence of Q-points (which is consistent with ZFC) we prove that the free topological group $F(X)$ over a Tychonov space $X$ is $o$-bounded if and only if every continuous metrizable image $T$ of $X$ satisfies the selection…

General Topology · Mathematics 2009-11-05 Taras Banakh , Dušan Repovš , Lyubomyr Zdomskyy

We investigate the proof theory of regular expressions with fixed points, construed as a notation for (omega-)context-free grammars. Starting with a hypersequential system for regular expressions due to Das and Pous, we define its extension…

Logic in Computer Science · Computer Science 2024-04-26 Anupam Das , Abhishek De

Let $G$ be a group, and let $S$ be a finite subset of $G$ that generates $G$ as a monoid. The co-word problem is the collection of words in the free monoid $S^{\ast}$ that represent non-trivial elements of $G$. A current conjecture, based…

Group Theory · Mathematics 2014-06-19 Daniel Farley

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Logic · Mathematics 2018-11-21 M. Assem , T. S. Ahmed , G. Sági , D. Sziráki

We prove that the common theory of nonabelian free groups has the dimensional order property, or DOP, implying, for example, that there is no reasonable structure theorem for $\aleph_1$-saturated models of this theory.

Logic · Mathematics 2017-05-04 Anand Pillay , Rizos Sklinos

It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…

Group Theory · Mathematics 2015-06-12 Tamer Tlas

An elementary proof that certain pairs of $2\times 2$ matrices with nonnegative real coordinates generate free monoids.

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and Delta_2 (and…

Formal Languages and Automata Theory · Computer Science 2009-10-02 Volker Diekert , Manfred Kufleitner

A bi-order on a group $G$ is a total, bi-multiplication invariant order. A subset $S$ in an ordered group $(G,\leqslant)$ is convex if for all $f\leqslant g$ in $S$, every element $h\in G$ satisfying $f\leqslant h \leqslant g$ belongs to…

Group Theory · Mathematics 2024-08-06 Wenhao Wang

It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

We show that Baumslag-Solitar groups are virtually 2-avoidable, that is, they admit finite index subgroup whose first homology is devoid of $\mathbb{Z}_2$ summand. We also prove virtual 2-avoidability for some other classes of one-relator…

Group Theory · Mathematics 2025-04-21 Satyanath Howladar

We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent…

Logic in Computer Science · Computer Science 2017-09-12 Nathanaël Fijalkow , Charles Paperman

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

Group Theory · Mathematics 2008-02-03 Michael Shapiro

We prove that every verbally closed two-generated subgroup of a free solvable group G of a finite rank is a retract of G.

Group Theory · Mathematics 2019-01-18 V. A. Roman'kov , E. I. Timoshenko

We analyze the proof by Lehnert and Schweitzer that the word problem of the Thompson group V is co-context-free, and we show that this word problem is the complement of the cyclic closure of a union of reverse deterministic context-free…

Group Theory · Mathematics 2025-09-10 J. C. Birget

We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…

Formal Languages and Automata Theory · Computer Science 2020-12-03 Viktor Henriksson , Manfred Kufleitner

This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of…

Group Theory · Mathematics 2018-03-22 Tara Brough

Over an algebraically closed base field $k$ of characteristic 2, the ring $R^G$ of invariants is studied, $G$ being the orthogonal group O(n) or the special orthogonal group SO(n) and acting naturally on the coordinate ring $R$ of the…

Rings and Algebras · Mathematics 2014-07-31 M. Domokos , P. E. Frenkel

We prove that second rational homology of the Torelli group of an orientable closed surface of genus g is finite dimensional for g at least 51. This rules out the simplest obstruction to the Torelli group being finitely presented and…

Geometric Topology · Mathematics 2025-04-08 Daniel Minahan

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

Logic · Mathematics 2026-05-14 Mohammad Golshani , Grigorii Stepanov , Reihane Zoghifard