English
Related papers

Related papers: Definability and Scott rank in separable Metric st…

200 papers

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

Logic · Mathematics 2021-06-17 Paul K. Gorbow

The goal of the present paper is to provide a mathematically rigorous foundation to certain aspects of rational orbifold conformal field theory, in other words the theory of rational vertex operator algebras and their automorphisms. Under a…

q-alg · Mathematics 2009-10-30 Chongying Dong , Haisheng Li , Geoffrey Mason

We prove that the full automorphism group and the outer automorphism group of the free group of countably infinite rank are coarsely bounded. That is, these groups admit no continuous actions on a metric space with unbounded orbits, and…

Group Theory · Mathematics 2023-04-11 George Domat , Hannah Hoganson , Sanghoon Kwak

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form $\lambda + 3$, where $\lambda$ is a computable ordinal. This result was claimed by the author in his PhD…

Dynamical Systems · Mathematics 2018-03-12 Ilkka Törmä

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

We define coarse proximity structures, which are an analog of small-scale proximity spaces in the large-scale context. We show that metric spaces induce coarse proximity structures, and we construct a natural small-scale proximity…

Metric Geometry · Mathematics 2024-04-16 Pawel Grzegrzolka , Jeremy Siegert

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

Logic · Mathematics 2018-11-20 Gianluca Paolini , Saharon Shelah

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 survey some results on the structure of the groups which are definable in theories of fields involved in the applications of model theory to Diophantine geometry. We focus more particularly on separably closed fields of finite degree of…

Logic · Mathematics 2007-05-23 Elisabeth Bouscaren

Botelho, Jamison, and Moln\'ar \cite{BJM}, and Geh\' er and \v{S}emrl \cite{GeS} have recently described the general form of surjective isometries of Grassmann spaces of all projections of a fixed finite rank on a Hilbert space $H$. As a…

Functional Analysis · Mathematics 2018-05-22 Gy. P. Gehér , P. Šemrl

This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…

Logic in Computer Science · Computer Science 2025-02-17 Marek Dančo , Mikoláš Janota , Michael Codish , João Jorge Araújo

We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product of countable (or separable metric) structures associated to the Fr\'echet filter.…

Logic · Mathematics 2022-07-18 Ilijas Farah , Saharon Shelah

To a special type of grope embedded in 4-space, that we call an admissible grope, we associate a length function for each real number q at least 1. This gives rise to a family of pseudo-metrics d^q, refining the slice genus metric, on the…

Geometric Topology · Mathematics 2017-06-29 Tim D. Cochran , Shelly Harvey , Mark Powell

We prove equality between the Topological Stable Rank and the Bass Stable Rank for finitely generated projective left modules over a unital C*-algebra. In order to do so, the concept of Stable Rank of a Hilbert module is introduced.

Operator Algebras · Mathematics 2014-03-11 Mauricio Achigar

Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust…

Logic in Computer Science · Computer Science 2022-08-29 Amin Farjudian , Eugenio Moggi

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Logic · Mathematics 2024-06-07 Miloš S. Kurilić

In this work we discuss logical structures related to indistinguishable particles. Most of the framework used to develop these structures was presented in [17, 28] and in [20, 14, 15, 16]. We use these structures and constructions to…

Quantum Physics · Physics 2013-05-23 Federico Holik , Decio Krause , Ignacio Gómez

We obtain some new results on the topology of unary definable sets in densely ordered Abelian groups of burden groups of burden 2. In the special case in which the structure has dp-rank 2, we show that the existence of an infinite definable…

Logic · Mathematics 2022-11-21 Alfred Dolich , John Goodrick

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin