中文
相关论文

相关论文: On the Topological Complexity of Infinitary Ration…

200 篇论文

A system of nonlinear differential equations $x^{1+\gamma}\frac{dY}{dx}= F_0(x)+A(x)Y+F(x,Y)$ is considered. We study more precisely the meaning of asymptotic expansion of transformations and solutions than preceding pioneering works, by…

经典分析与常微分方程 · 数学 2023-01-25 Sunao Ouchi

In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…

计算复杂性 · 计算机科学 2010-06-03 Vassilios Gregoriades

The causal set theory d'Alembertian has rational coefficients for which alternating expressions are known. Here, a combinatorial interpretation of these numbers is given.

组合数学 · 数学 2025-03-21 Karen Yeats

In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…

数论 · 数学 2024-11-20 Diego Alves , Jean Lelis , Diego Marques , Pavel Trojovský

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

表示论 · 数学 2026-02-24 Frank Lübeck

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual characterization results and insights from unified correspondence…

We investigate $\mathcal F$-Borel topological spaces. We focus on finding out how a~complexity of a~space depends on where the~space is embedded. Of a~particular interest is the~problem of determining whether a~complexity of given space $X$…

一般拓扑 · 数学 2020-02-24 Vojtěch Kovařík

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

逻辑 · 数学 2018-08-16 Vladimir Kanovei , Vassily Lyubetsky

We call a subset S of a topological vector space V linearly Borel, if for every finite number n, the set of all linear combinations of S of length n is a Borel subset of V. It will be shown that a Hamel base of an infinite dimensional…

逻辑 · 数学 2007-05-23 Lorenz Halbeisen

We demonstrate that the set $L^\infty(X, [-1,1])$ of all measurable functions over a Borel measure space $(X, \mathcal B, \mu )$ with values in the unit interval is typically non-polyhedric when interpreted as a subset of a dual space. Our…

最优化与控制 · 数学 2017-11-08 Constantin Christof , Gerd Wachsmuth

A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…

逻辑 · 数学 2019-11-22 R. Jansana , T. Moraschini

We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep…

组合数学 · 数学 2021-01-19 Oleg Pikhurko

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

计算机科学中的逻辑 · 计算机科学 2026-04-01 Leonid A. Levin

We show that, up to Morita equivalence, any finite-dimensional algebra with a suitable homological system, admits an exact Borel subalgebra. This generalizes a theorem by Koenig, K\"ulshammer and Ovsienko, which holds for quasi-hereditary…

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

逻辑 · 数学 2016-09-06 Boban Velickovic , W. Hugh Woodin

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…

群论 · 数学 2010-11-11 Matthew Dyer

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…

计算机科学中的逻辑 · 计算机科学 2015-03-19 Nikolay Ivanov , Dimiter Vakarelov

We define some natural notions of strong and weak Borel Ramsey properties for countable Borel equivalence relations and show that they hold for a countable Borel equivalence relation if and only if the equivalence relation is smooth. We…

逻辑 · 数学 2025-03-28 Su Gao , Ming Xiao

Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in \cite{pu18}. 2. We investigate the existence of p-optimal proof systems for $\mathsf{TAUT}$, assuming…

逻辑 · 数学 2019-04-08 Erfan Khaniki