English
Related papers

Related papers: Saturated Free Algebras and Almost Indiscernible T…

200 papers

Let $A$ be a ring of dimension $d$ containing an infinite field $k$, $T_1,\ldots,T_r$ be variables over $A$ and $P$ be a projective $A[T_1,\ldots,T_r]$-module of rank $n$. Assume one of the following conditions hold. (1) $2n\geq d+3$ and…

Commutative Algebra · Mathematics 2023-07-06 Manoj K. Keshari , Soumi Tikader

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

Logic · Mathematics 2018-01-16 Nathanael Ackerman , Cameron Freer , Rehana Patel

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

Formal Languages and Automata Theory · Computer Science 2020-04-10 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter

We show that certain classes of modules have universal models with respect to pure embeddings. $Theorem.$ Let $R$ be a ring, $T$ a first-order theory with an infinite model extending the theory of $R$-modules and $K^T=(Mod(T), \leq_{pp})$…

Logic · Mathematics 2020-02-24 Thomas G. Kucera , Marcos Mazari-Armida

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

Logic · Mathematics 2014-02-10 Matteo Viale , Giorgio Audrito , Silvia Steila

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

Representation Theory · Mathematics 2018-09-25 Calin Chindris , Ryan Kinser

In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…

Logic · Mathematics 2023-02-07 James Hanson

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

Logic · Mathematics 2015-08-19 M. Malliaris , S. Shelah

We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…

General Topology · Mathematics 2010-10-13 Dušan Repovš , Lyubomyr Zdomskyy

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Logic · Mathematics 2025-12-23 Anupam Das , Abhishek De , Stepan L. Kuznetsov

We show that certain field theory models, although non-integrable according to the usual definition of integrability, share some of the features of integrable theories for certain configurations. Here we discuss our attempt to define a…

High Energy Physics - Theory · Physics 2015-06-16 L. A. Ferreira , G. Luchini , Wojtek J. Zakrzewski

It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…

Logic · Mathematics 2025-07-15 Luca Carai , Tommaso Moraschini

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 many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

In this paper, we introduce the notions of $\alpha$-quasicomplemented and totally $\alpha$-quasicomplemented subspaces and we established some results under these contexts. We show, for example, that if $X$ is a separable or reflexive…

Functional Analysis · Mathematics 2024-03-12 A. Barbosa , A. Raposo , G. Ribeiro

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

Logic · Mathematics 2025-10-07 Yong Cheng

A uniform algebra $A$ on its Shilov boundary $X$ is {\em maximal} if $A$ is not $C(X)$ and there is no uniform algebra properly contained between $A$ and $C(X)$. It is {\em essentially pervasive} if $A$ is dense in $C(F)$ whenever $F$ is a…

Functional Analysis · Mathematics 2014-02-11 Pamela Gorkin , Anthony G. O'Farrell

Twilled L(ie)-R(inehart) algebas generalize, in the Lie-Rinehart context, complex structures on smooth manifolds. An almost complex manifold determines an almost twilled pre-LR algebra, which is a true twilled LR-algebra iff the almost…

Differential Geometry · Mathematics 2007-05-23 Johannes Huebschmann

Given a state on an algebra of bounded quantum-mechanical observables (the self-adjoint part of a C*-algebra), we investigate those subalgebras that are maximal with respect to the property that the given state's restriction to the…

Quantum Physics · Physics 2007-05-23 Hans Halvorson , Rob Clifton

Building on prior work on distributed databases and the CALM Theorem, we define and study the question of free termination: in the absence of distributed coordination, what query properties allow nodes in a distributed (database) system to…

Databases · Computer Science 2025-02-04 Conor Power , Paraschos Koutris , Joseph M Hellerstein
‹ Prev 1 3 4 5 6 7 10 Next ›