English
Related papers

Related papers: David's trick

200 papers

We define the property of Pi_2-compactness of a statement phi of set theory, meaning roughly that the hard core of the impact of phi on combinatorics of aleph_1 can be isolated in a canonical model for the statement phi. We show that the…

Logic · Mathematics 2009-09-25 Saharon Shelah , Jindřich Zapletal

Let $K$ be an algebraic number field, and $\pi=\otimes\pi_{v}$ an irreducible, automorphic, cuspidal representation of $\GL_{m}(\mathbb{A}_{K})$ with analytic conductor $C(\pi)$. The theorem on analytic strong multiplicity one established…

Number Theory · Mathematics 2008-12-11 Jianya Liu , Yonghui Wang

The aim of this paper is to prove a generalization of the famous Theorem A of Quillen for strict $\infty$-categories. This result is central to the homotopy theory of strict $\infty$-categories developed by the authors. The proof presented…

Algebraic Topology · Mathematics 2020-09-07 Dimitri Ara , Georges Maltsiniotis

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

We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…

Formal Languages and Automata Theory · Computer Science 2020-04-03 Štěpán Holub

In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of…

Logic · Mathematics 2017-04-05 Keita Yokoyama

For more than a century, Cantor's theory of transfinite numbers has played a pivotal role in set theory, with ramifications that extend to many areas of mathematics. This article extends earlier findings with a fresh look at the critical…

General Mathematics · Mathematics 2023-05-17 Juan A Perez

We investigate Diophantine definability and decidability over some subrings of algebraic numbers contained in quadratic extensions of totally real algebraic extensions of $\mathbb Q$. Among other results we prove the following. The big…

Number Theory · Mathematics 2007-05-23 Alexandra Shlapentokh

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

We present a classification algorithm for isolated hypersurface singularities of corank 2 and modality 1 over the real numbers. For a singularity given by a polynomial over the rationals, the algorithm determines its right equivalence class…

Algebraic Geometry · Mathematics 2020-10-16 Janko Boehm , Magdaleen S. Marais , Andreas Steenpass

Inspired by the intrinsic formality of graded algebras, we prove a necessary and sufficient condition for strongly uniqueness of DG-enhancements. This approach offers a generalization to linearity over any commutative ring. In particular,…

K-Theory and Homology · Mathematics 2026-02-27 Antonio Lorenzin

For a restricted Lie superalgebra g over an algebraically closed field of characteristic p > 2, we generalize the deformation method of Premet and Skryabin to obtain results on the p-power and 2-power divisibility of dimensions of…

Representation Theory · Mathematics 2009-10-13 Lei Zhao

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We study the extension of dependence logic D by a majority quantifier M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all…

Logic in Computer Science · Computer Science 2013-03-11 Arnaud Durand , Johannes Ebbing , Juha Kontinen , Heribert Vollmer

By complexifying a Hamiltonian system one obtains dynamics on a holomorphic symplectic manifold. To invert this construction we present a theory of real forms which not only recovers the original system but also yields different real…

Symplectic Geometry · Mathematics 2025-01-03 Philip Arathoon , Marine Fontaine

In this paper, we first establish an $S^1$-equivariant index theorem for Spin$^c$ Dirac operators on $\mathbb{Z}/k$ manifolds, then combining with the methods developed by Taubes \cite{MR998662} and Liu-Ma-Zhang \cite{MR1870666,MR2016198},…

Differential Geometry · Mathematics 2011-04-21 Bo Liu , Jianqing Yu

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

If $A$, $B$, $C$ are subsets in a finite simple group of Lie type $G$ at least two of which are normal with $|A||B||C|$ relatively large, then we establish a stronger conclusion than $ABC = G$. This is related to a theorem of Gowers and is…

Group Theory · Mathematics 2024-04-09 Francesco Fumagalli , Attila Maróti

We prove the semisimplicity conjecture for A-motives over finitely generated fields K. This conjecture states that the rational Tate modules V_p(M) of a semisimple A-motive M are semisimple as representations of the absolute Galois group of…

Number Theory · Mathematics 2019-02-20 Nicolas Stalder

About 35 years ago Dennis Sullivan proved a precompactness property ("complex bounds") for infinitely renormalizable real quadratic polynomials with bounded combinatorics. We present a simple "soft" proof of this remarkable result.

Dynamical Systems · Mathematics 2026-01-30 Genadi Levin