English
Related papers

Related papers: Definable Towers

200 papers

This article shows that for unitary dual reductive pairs the first occurrence of theta lift of an irreducible cuspidal automorphic representation is irreducible. It also proves a refined tower property for theta lifts and the involutive…

Number Theory · Mathematics 2014-09-03 Chenyan Wu

We show that a compact complex parallelisable nilmanifold has unobstructed deformations if and only if its associated Lie algebra satisfies a reality condition and is a free Lie algebra in a variety of Lie algebras, that is, defined by a…

Differential Geometry · Mathematics 2024-11-27 Matthias Paulsen , Sönke Rollenske , Konstantin Wehler

We produce a forcing extension of the constructible universe $\bL$ in which every universally measurable set of reals is $\uTDelta^{1}_{2}$, partially answering question CG from David Fremlin's problem list. The analogous result for…

Logic · Mathematics 2023-06-21 Paul B. Larson , Saharon Shelah

For a non-compact finite thickness building whose Davis apartment is an orientable pseudomanifold, we compute the supremum of the set of $p>1$ such that its top dimensional reduced $\ell^p$-cohomology is nonzero. We adapt the non-vanishing…

Group Theory · Mathematics 2025-01-03 Antonio López Neumann

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

Logic · Mathematics 2026-03-30 Su Gao , André Nies , Gianluca Paolini

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Logic in Computer Science · Computer Science 2021-09-27 Simon Halfon , Philippe Schnoebelen , Georg Zetzsche

This article is the first one of a series aiming to construct an isomorphism between the p-adic Lubin-Tate and Drinfeld towers, describe this isomorphism and give applications. We construct a p-adic equivariant integral model of the…

Number Theory · Mathematics 2007-05-23 Laurent Fargues

We consider model-theoretic properties related to the expressive power of three analogues of $L_{\omega_1, \omega}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the…

Logic · Mathematics 2017-08-10 Christopher J. Eagle

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…

Logic in Computer Science · Computer Science 2021-04-21 A. R. Balasubramanian , Timo Lang , Revantha Ramanayake

This paper builds a cumulative tower of Grothendieck universes that provides a precise size discipline for higher type theory. Starting from an increasing sequence of inaccessible cardinals, we give an inductive-recursive definition of…

Logic · Mathematics 2025-06-30 Higuchi Joaquim Reizi

We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their…

Combinatorics · Mathematics 2025-10-29 Emiliano Liwski , Fatemeh Mohammadi

Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We…

Logic in Computer Science · Computer Science 2015-07-01 Ben Moszkowski

We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical…

Logic · Mathematics 2015-08-28 Leszek Aleksander Kołodziejczyk , Henryk Michalewski

We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…

Logic · Mathematics 2007-05-23 Dmytro Taranovsky

An infinite filiform Lie algebra L is residually nilpotent and its graded associated with respect to the lower central series has smallest possible dimension in each degree but is still infinite. This means that gr(L) is of dimension two in…

Rings and Algebras · Mathematics 2020-10-27 Clas Löfwall

We give a complete description of Lie algebras graded by an infinite irreducible locally finite root system.

Quantum Algebra · Mathematics 2011-06-28 Malihe Yousofzadeh

Infinite Time Register Machines ($ITRM$'s) are a well-established machine model for infinitary computations. Their computational strength relative to oracles is understood, see e.g. Koepke (2009), Koepke and Welch (2011) and Koepke and…

Logic · Mathematics 2026-05-19 Merlin Carl

In this paper we consider nonmeasurablity with respect to sigma-ideals defined be trees. First classical example of such ideal is Marczewski ideal s_0. We will consider also ideal l_0 defined by Laver trees and m_0 defined by Miller trees.…

General Topology · Mathematics 2015-07-10 Robert Ralowski , Szymon Zeberski

For a fairly general class of two-dimensional tiling substitutions, we prove that if the length expansion $\beta$ is a Pisot number, then the tilings defined by the substitution must be locally finite. We also give a simple example of a…

Dynamical Systems · Mathematics 2012-08-27 Natalie Priebe Frank , E. Arthur Robinson,