English
Related papers

Related papers: Logic of Sets with Atoms

200 papers

We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…

Logic · Mathematics 2018-02-06 Dániel T. Soukup , Lajos Soukup

We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability…

Logic in Computer Science · Computer Science 2023-06-22 Bartek Klin , Mateusz Łełyk

Different notions of equivalence, such as the prominent notions of strong and uniform equivalence, have been studied in Answer-Set Programming, mainly for the purpose of identifying programs that can serve as substitutes without altering…

Artificial Intelligence · Computer Science 2010-06-16 Michael Fink

Classical mathematics are founded within set theory, but sets don't have \emph{symmetries}. We conjecture that if we allow sets with symmetries, then many problems such as \emph{Mirror symmetry} or \emph{Homological mirror symmetry} can be…

Algebraic Topology · Mathematics 2014-07-09 Hugo V. Bacard

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…

Quantum Physics · Physics 2023-05-25 Margarite L. LaBorde

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…

Operator Algebras · Mathematics 2026-05-20 Lucas Alger , Julie Capron , Félix de la Salle

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

General Topology · Mathematics 2020-08-05 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

Algebraic Geometry · Mathematics 2017-08-31 Masahiro Shiota

Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…

Discrete Mathematics · Computer Science 2007-11-16 Michel Grabisch

Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic…

We study two kinds of generalizations of symmetric block designs to higher dimensions, the so-called $\mathcal{C}$-cubes and $\mathcal{P}$-cubes. For small parameters, all examples up to equivalence are determined by computer calculations.…

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Mario Osvin Pavčević

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Logic · Mathematics 2025-06-09 Nicolás Cuervo Ovalle , Isaac Goldbring

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

The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…

Logic in Computer Science · Computer Science 2015-07-01 Barnaby Martin , Manuel Bodirsky , Martin Hils

We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.

Group Theory · Mathematics 2024-01-26 Noah Caplinger , Dan Margalit

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Logic · Mathematics 2018-02-12 Russell Miller , Alexandra Shlapentokh

Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…

Algebraic Topology · Mathematics 2008-07-29 Shaun Ault

There are various statements in the physics literature about the stratification of quantum states, for example into orbits of a unitary group, and about generalized differentiable structures on it. Our aim is to clarify and make precise…

Operator Algebras · Mathematics 2021-12-28 Francesco D'Andrea , Davide Franco

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