English
Related papers

Related papers: On the logical strength of Nash-Williams' theorem …

200 papers

We prove that continuous reducibility is a well-quasi-order on the class of continuous functions between separable metrizable spaces with analytic zero-dimensional domain. To achieve this, we define scattered functions, which generalize…

Logic · Mathematics 2024-10-18 Raphaël Carroy , Yann Pequignot

A structure is called weakly oligomorphic if it realizes only finitely many n-ary positive existential types for every n. The goal of this paper is to show that the notions of homomorphism-homogeneity, and weak oligomorphy are not only…

Logic · Mathematics 2017-04-04 Christian Pech , Maja Pech

Motivated by Berg's notion of quasi-disjointness for ergodic systems, we introduce and investigate the concept of quasi-disjointness for minimal systems. Several equivalent characterizations are provided. We prove that quasi-disjointness is…

Dynamical Systems · Mathematics 2026-05-29 Hui Xu , Xiangdong Ye

A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…

Quantum Physics · Physics 2015-06-04 A. Vourdas

Non-commutative (NC) field theories can be mapped onto twisted matrix models. This mapping enables their Monte Carlo simulation, where the large N limit of the matrix models describes the continuum limit of NC field theory. First we present…

High Energy Physics - Lattice · Physics 2009-11-07 W. Bietenholz , F. Hofheinz , J. Nishimura

We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…

Logic · Mathematics 2023-11-09 Nikolay Bazhenov , Marta Fiori-Carones , Lu Liu , Alexander Melnikov

In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results…

Combinatorics · Mathematics 2007-05-23 V. Farmaki , S. Negrepontis

Walsh [MR4525964, Zbl 1569.03151] has shown that comparing proof-theoretic ordinals is equivalent to comparing $\Pi^1_1$-consequence comparison and $\Pi^1_1$-reflection comparison, all modulo true $\Sigma^1_1$-sentences. In this paper, we…

Logic · Mathematics 2026-02-10 Hanul Jeon

The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…

Dynamical Systems · Mathematics 2014-05-06 Dominik Kwietniak , Piotr Oprocha

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

Based on quantitative ``{\sc kam} theory'', we state and prove two theorems about the continuation of maximal and whiskered quasi--periodic motions to slightly perturbed systems exhibiting proper degeneracy. Next, we apply such results to…

Dynamical Systems · Mathematics 2024-07-10 Gabriella Pinzari , Xiang Liu

Assume $\mathcal{C}$ is the class of all linear orders $L$ such that $L$ is not a countable union of well ordered sets, and every uncountable subset of $L$ contains a copy of $\omega_1$. We show it is consistent that $\mathcal{C}$ has…

Logic · Mathematics 2020-10-29 Hossein Lamei Ramandi

We give an alternate proof of the main theorem of Kawamata's paper: Pluricanonical systems on minimal algebraic varieties. Our proof also works for varieties in class $\mathcal C$. We note that our proof is completely different from…

Algebraic Geometry · Mathematics 2009-10-08 Osamu Fujino

We explore the Weihrauch degree of the problems ``find a bad sequence in a non-well quasi order'' ($\mathsf{BS}$) and ``find a descending sequence in an ill-founded linear order'' ($\mathsf{DS}$). We prove that $\mathsf{DS}$ is strictly…

Logic · Mathematics 2025-09-23 Jun Le Goh , Arno Pauly , Manlio Valenti

We present an optimal rate convergence analysis for a second order accurate in time, fully discrete finite difference scheme for the Cahn-Hilliard-Navier-Stokes (CHNS) system, combined with logarithmic Flory-Huggins energy potential. The…

Numerical Analysis · Mathematics 2024-05-07 Wenbin Chen , Jianyu Jing , Qianqian Liu , Cheng Wang , Xiaoming Wang

Kashiwara conjectured that the hard Lefshetz theorem and the semisimplicity theorem hold for any semisimple perverse sheaf M on a variety over a field of characteristic 0. He also conjectured that if you apply to such M the nearby cycle…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Drinfeld

The (A)CGW categories of Campbell and Zakharevich show how finite sets and varieties behave like the objects of an exact category for the purpose of algebraic $K$-theory. These structures admit a well-behaved Q-construction akin to…

K-Theory and Homology · Mathematics 2025-04-29 Maru Sarazola , Brandon T. Shapiro

In this paper, we characterize quasi-integrable modules, of nonzero level, over twisted affine Lie superalgebras. We show that quasi-integrable modules are not necessarily highest weight modules. We prove that each quasi-integrable module…

Representation Theory · Mathematics 2022-02-02 Malihe Yousofzadeh

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a…

Logic · Mathematics 2011-06-06 Alberto Marcone , Antonio Montalbán

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…

Logic in Computer Science · Computer Science 2016-07-07 Prateek Karandikar , Philippe Schnoebelen
‹ Prev 1 8 9 10 Next ›