中文
相关论文

相关论文: The Borel monadic theory of order is decidable

200 篇论文

We investigate and compare $\mathcal F$-Borel classes and absolute $\mathcal F$-Borel classes. We provide precise examples distinguishing these two hierarchies. We also show that for separable metrizable spaces, $\mathcal F$-Borel classes…

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

Let $\mathbb{F}$ be an algebraically closed field of characteristic $p>3$, and $\ggg$ the $p$-dimensional Witt algebra over $\mathbb{F}$. Let $\N$ be the nilpotent cone of $\ggg$. Explicit description of $\N$ is given, so that the conjugacy…

表示论 · 数学 2012-12-19 Yu-Feng Yao , Hao Chang

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

群论 · 数学 2021-09-14 Grechkoseeva Mariya

We characterize the equational theories and Lawvere theories that correspond to the categories of analytic and polynomial monads on Set, and hence also the categories of the symmetric and rigid operads in Set. We show that the category of…

范畴论 · 数学 2019-02-20 Stanisław Szawiel , Marek Zawadowski

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

逻辑 · 数学 2014-11-26 Márton Elekes , Tamás Keleti

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

逻辑 · 数学 2023-06-22 Oleg Kudinov , Victor Selivanov

We prove a homological stability theorem for congruence subgroups of symplectic groups. From this theorem, we deduce a generalization of a theorem of Borel showing that certain homology groups of a congruence subgroup do not depend on the…

代数拓扑 · 数学 2017-05-04 David Bruce Cohen

In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor $Jf:F\rightarrow Sets$ where $F$ is the category with the set of objects…

范畴论 · 数学 2016-01-12 Vladimir Voevodsky

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

逻辑 · 数学 2025-02-05 Alexander Van Abel

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

计算机科学中的逻辑 · 计算机科学 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg

The aim of this paper is to study the relationship between reduction numbers and Borel-fixed ideals in all characteristics. By definition, Borel-fixed ideals are closed under certain specializations which is similar to the strong stability.…

交换代数 · 数学 2007-05-23 Le Tuan Hoa , Ngo Viet Trung

The theory of $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ is decidable if $a$ is quadratic. If $a$ is the golden ratio, $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ defines multiplication by $a$. The results are established by using the…

逻辑 · 数学 2017-04-21 Philipp Hieronymi

Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…

逻辑 · 数学 2025-08-26 Thomas Scanlon

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

逻辑 · 数学 2015-12-17 Fedor Pakhomov

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

数论 · 数学 2025-10-21 Joaquim Cera Da Conceição

Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…

范畴论 · 数学 2025-06-03 Brandon Shapiro

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

计算机科学中的逻辑 · 计算机科学 2018-05-10 Alexis Bès , Christian Choffrut

A \emph{hull} of $A \subset [0,1]$ is a set $H$ containing $A$ such that $\lambda^*(H)=\lambda^*(A)$. We investigate all four versions of the following problem. Does there exist a monotone (wrt. inclusion) map that assigns a…

经典分析与常微分方程 · 数学 2011-09-23 Márton Elekes , András Máthé

We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.

逻辑 · 数学 2013-03-12 Toshiyasu Arai

Let $\bf\Gamma$ be a Borel class, or a Wadge class of Borel sets, and $2\leq d\leq\omega$ a cardinal. We study the Borel subsets of ${\mathbb R}^d$ that can be made $\bf\Gamma$ by refining the Polish topology on the real line. These sets…

逻辑 · 数学 2010-02-09 Dominique Lecomte
‹ 上一页 1 8 9 10 下一页 ›