English
Related papers

Related papers: Generic Saturation

200 papers

We continue the study of a class of topological $\mathcal{L}$-fields endowed with a generic derivation $\delta$, focussing on describing definable groups. We show that one can associate to an $\mathcal{L}_{\delta}$ definable group a type…

Logic · Mathematics 2020-07-24 Francoise Point

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

Formal Languages and Automata Theory · Computer Science 2024-07-02 Achim Blumensath

Let $G$ be a finite group of Lie type and $\ell$ be a prime which is not equal to the defining characteristic of $G$. In this note we discuss some open problems concerning the $\ell$-modular irreducible representations of $G$. We also…

Representation Theory · Mathematics 2011-07-04 Meinolf Geck

Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…

Logic · Mathematics 2018-05-23 David Aspero , Matteo Viale

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…

Logic · Mathematics 2023-06-22 Philip Dittmann , Dion Leijnse

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is…

Formal Languages and Automata Theory · Computer Science 2020-02-24 Mikołaj Bojańczyk , Edon Kelmendi , Rafał Stefański , Georg Zetzsche

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

Logic in Computer Science · Computer Science 2023-06-22 Zoltan Esik , Dexter Kozen

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…

Group Theory · Mathematics 2020-10-27 Jason Bell , Adam Clay , Tyrone Ghaswala

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations.…

Formal Languages and Automata Theory · Computer Science 2019-02-14 Thomas Place , Marc Zeitoun

We introduce a new and natural stationary set preserving forcing $\mathbb P^{c-c}({\lambda},{\mu})$ that (under $\mathsf{NS}_{\omega_1}$ precipitous + existence of $H_{\theta}^#$ for a sufficiently large regular ${\theta}$) increases the…

Logic · Mathematics 2024-02-13 Ben De Bondt , Boban Velickovic

Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…

Computational Geometry · Computer Science 2018-01-19 Udo Hoffmann , Keno Merckx

A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…

Combinatorics · Mathematics 2026-05-19 Zakir Deniz , Hakan Guler , Anthony Nixon

Let X be a smooth variety over a field of positive characteristic, and let E be an overconvergent isocrystal on X. We establish a criterion for the existence of a "canonical logarithmic extension" of E to a good compactification of X. In…

Number Theory · Mathematics 2007-05-23 Kiran S. Kedlaya

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Denis Kuperberg

We prove that in the Cohen extension adding $\aleph_3$ generic reals to a model of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, gap-2 morass-definable $\eta_1$-orderings with cardinality $\aleph_3$ are order-isomorphic. Hence it…

Logic · Mathematics 2019-05-24 Bob A Dumas

A language $L$ is said to be ${\cal C}$-measurable, where ${\cal C}$ is a class of languages, if there is an infinite sequence of languages in ${\cal C}$ that ``converges'' to $L$. We investigate the properties of ${\cal C}$-measurability…

Formal Languages and Automata Theory · Computer Science 2025-06-18 Ryoma Sin'ya , Takao Yuyama

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

Logic · Mathematics 2020-12-22 Emanuele Frittaion , Michael Rathjen
‹ Prev 1 8 9 10 Next ›