English
Related papers

Related papers: Countable imaginary simple unidimensional theories

200 papers

For semisimple Lie superalgebras over an algebraically closed field of characteristic zero, whose category of finite dimensional super representations is semisismple, we classify all irreducible super representations for which the…

Representation Theory · Mathematics 2010-02-24 T. Krämer , R. Weissauer

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…

Logic · Mathematics 2015-03-17 Predrag Tanović

We reconstruct finite-dimensional quantum theory with superselection rules, which can describe hybrid quantum-classical systems, from four purely operational postulates: symmetric sharpness, complete mixing, filtering, and local equality.…

Quantum Physics · Physics 2026-05-26 Kenji Nakahira

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

Representation Theory · Mathematics 2016-11-29 Volodymyr Mazorchuk , Kaiming Zhao

A longstanding question is to characterize the lattice of supersets (modulo finite sets), $\mathcal{L}^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $\mathcal{L}^*(A)\cong {\mathcal E}^*$. In spite of claims…

Logic · Mathematics 2025-10-15 Peter Cholak , Rodney Downey , Noam Greenberg

Our aim is to solve a quite old question on the difference between expandability and compact expandability. Toward this, we further investigate the logic of countable cofinality.

Logic · Mathematics 2019-09-18 Enrique Casanovas , Saharon Shelah

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Logic in Computer Science · Computer Science 2017-04-11 Arno Pauly

Over thirty years ago, Kalai proved a beautiful $d$-dimensional analog of Cayley's formula for the number of $n$-vertex trees. He enumerated $d$-dimensional hypertrees weighted by the squared size of their $(d-1)$-dimensional homology…

Combinatorics · Mathematics 2018-01-09 Nati Linial , Yuval Peled

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Logic · Mathematics 2014-02-14 Joel David Hamkins

We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…

Logic · Mathematics 2017-07-25 Andre Kornell

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Logic · Mathematics 2016-07-07 Frank Olaf Wagner

We investigate a notion called uniqueness in power kappa that is akin to categoricity in power kappa, but is based on the cardinality of the generating sets of models instead of on the cardinality of their universes. The notion is quite…

Logic · Mathematics 2016-09-06 Steven Givant , Saharon Shelah

We classify decompositions of simple special finite-dimensional Jordan superalgebras over an algebraically closed field of characteristic zero into the sum of two proper simple subsuperalgebras.

Rings and Algebras · Mathematics 2007-05-23 M. V. Tvalavadze

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

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

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

Functional Analysis · Mathematics 2016-10-26 Tomasz Kania , Tomasz Kochanek

We demonstrate the successful use of scattering representations without further compression for simulation-based inference (SBI) with images (i.e. field-level), illustrated with a cosmological case study. Scattering representations provide…

Machine Learning · Computer Science 2024-12-03 Kiyam Lin , Benjamin Joachimi , Jason D. McEwen

We consider a theory of scalar superfields in two dimensions with arbitrary superpotential. By imposing no particle production in tree level scattering, we constrain the form of the admissible interactions, recovering a supersymmetric…

High Energy Physics - Theory · Physics 2018-05-23 Carlos Bercini , Diego Trancanelli

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

Logic · Mathematics 2025-08-12 Anand Pillay , Predrag Tanović

We consider the finite W-superalgebras for a basic classical Lie superalgebra g associated with an even nilpotent element in g both over the field of complex numbers field and and over a filed of positive characteristic. We present the PBW…

Representation Theory · Mathematics 2014-05-13 Yang Zeng , Bin Shu
‹ Prev 1 3 4 5 6 7 10 Next ›