English
Related papers

Related papers: On products of elementarily indivisible structures

200 papers

Let $S \subset \mathbb{Z}^{d}$ be a finitely generated subsemigroup. Let $E$ be a product system over $S$. We show that there exists an infinite dimensional separable Hilbert space $\mathcal{H}$ and a semigroup $\alpha:=\{\alpha_x\}_{x \in…

Operator Algebras · Mathematics 2017-09-27 S. P. Murugan , S. Sundar

To Rogers (1994) we owe the insight that monadic second order predicate logic with multiple successors (MSO) is well suited in many respects as a realistic formal base for syntactic theorizing. However, the agreeable formal properties of…

cmp-lg · Computer Science 2008-02-03 Uwe Moennich

We consider the Poisson algebra S(M) of smooth functions on T^*M which are fiberwise polynomial. In the case where M is locally projectively (resp. conformally) flat, we seek the star-products on S(M) which are SL(n+1,R) (resp.…

Quantum Algebra · Mathematics 2009-11-10 C. Duval , A. M. El Gradechi , V. Ovsienko

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

We solve a long standing open problem concerning the structure of finite cycles in the category mod A of finitely generated modules over an arbitrary artin algebra A, that is, the chains of homomorphisms $M_0 \stackrel{f_1}{\rightarrow} M_1…

Representation Theory · Mathematics 2015-04-02 Piotr Malicki , José Antonio de la Peña , Andrzej Skowroński

We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is…

Logic in Computer Science · Computer Science 2023-06-22 Julien Grange

Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While researchers have identified many uses of spatial conjunction, its…

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

Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L $\infty$$\lambda$. We prove that…

Category Theory · Mathematics 2020-09-03 Friedrich Wehrung

Our basic concept is the set $\mathcal{E}(H)$ of effects on a finite dimensional complex Hilbert space $H$. If $a,b\in\mathcal{E}(H)$, we define the sequential product $a[\mathcal{I}]b$ of $a$ then $b$. The sequential product depends on the…

Quantum Physics · Physics 2023-08-01 Stanley Gudder

Let R be a ring, M a nonzero left R-module, X an infinite set, and E the endomorphism ring of the direct sum of copies of M indexed by X. Given two subrings S and S' of E, we will say that S is equivalent to S' if there exists a finite…

Rings and Algebras · Mathematics 2012-06-11 Zachary Mesyan

We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington, and Lachlan proved for $\omega$-stable $\omega$-categorical structures. In particular, we prove that such structures have finite {\th}-rank…

Logic · Mathematics 2021-07-07 Alf Onshuus , Pierre Simon

We give necessary and sufficient conditions for a closed smooth 6-manifold N to be diffeomorphic to a product of a surface F and a simply connected 4-manifold M in terms of basic invariants like the fundamental group and cohomological data.…

Geometric Topology · Mathematics 2017-08-29 Ian Hambleton , Matthias Kreck

We study monoids equipped with a second binary operation that captures the structure of the endomorphisms of an object $X$ such that $X=X\times X$. We construct a universal monoid of this type and examine some of its rich combinatorial…

Category Theory · Mathematics 2016-08-23 Aaron Gray , Keith Pardue

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…

Logic · Mathematics 2007-11-21 Rüdiger Göbel , Saharon Shelah

Denote Hrushovski's non-collapsed ab initio construction for an $n$-ary relation by $\mathcal{M}_{\not\sim}$ and the analogous construction for a symmetric $n$-ary relation by $\mathcal{M}_{\sim}$. We show that $\mathcal{M}_{\not\sim}$ is…

Logic · Mathematics 2021-09-03 Omer Mermelstein

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…

Logic · Mathematics 2012-06-12 Saharon Shelah

This work is devoted to the study of the symmetries of (quasi)periodic architectured materials. For this purpose, the weaker symmetry criterion of indistinguishability is used. It relies on a statistical description of the mesostructure and…

Mathematical Physics · Physics 2026-04-03 Markus Hubert , Christelle Combescure , Renald Brenner , Nicolas Auffray

We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…

Formal Languages and Automata Theory · Computer Science 2018-12-06 Martin Beaudry

A class of structures is said to have the homomorphism-preservation property just in case every first-order formula that is preserved by homomorphisms on this class is equivalent to an existential-positive formula. It is known by a result…

Logic in Computer Science · Computer Science 2009-03-08 Anuj Dawar

We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.

Logic · Mathematics 2025-01-07 James E. Hanson