中文
相关论文

相关论文: Continuous Fraisse Conjecture

200 篇论文

We develop some foundations of commutative algebra, with a view towards algebraic geometry, in symmetric tensor categories. Most results establish analogues of classical theorems, in tensor categories which admit a tensor functor to some…

范畴论 · 数学 2026-02-20 Kevin Coulembier

We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…

逻辑 · 数学 2019-03-14 Takayuki Kihara

We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…

计算机科学中的逻辑 · 计算机科学 2024-10-22 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

逻辑 · 数学 2015-12-11 Andreas Blass , Mauro Di Nasso

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

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of…

逻辑 · 数学 2019-05-20 Nathanael Ackerman , Will Boney , Sebastien Vasey

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

逻辑 · 数学 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We present a clausal resolution-based method for normal multimodal logics of confluence, whose Kripke semantics are based on frames characterised by appropriate instances of the Church-Rosser property. Here we restrict attention to eight…

计算机科学中的逻辑 · 计算机科学 2014-08-20 Cláudia Nalon , João Marcos , Clare Dixon

Two rooted locally finite trees are considered equivalent if both can be embedded into each other as topological minors by means of tree-order preserving mappings. By exploiting Nash-William's Theorem, Matthiesen provided a non-constructive…

组合数学 · 数学 2016-04-18 J. Bruno

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

逻辑 · 数学 2021-03-11 Daisuke Ikegami , Philipp Schlicht , Hisao Tanaka

We consider categories of relational structures that fully embed every category of universal algebras, and prove a partial characterisation of these in terms of an infinitary variant of the notion of nowhere density of Ne\v{s}et\v{r}il and…

逻辑 · 数学 2023-03-24 Ioannis Eleftheriadis

We apply a categorical lens to the study of betweenness relations by capturing them within a topological category, fibred in lattices, and study several subcategories of it. In particular, we show that its full subcategory of finite objects…

范畴论 · 数学 2017-03-10 J. Bruno , A. McCluskey , P. Szeptycki

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone.…

We study some variants of the Erd\H{o}s similarity problem. We pose the question if every measurable subset of the real line with positive measure contains a similar copy of an infinite geometric progression. We construct a compact subset…

度量几何 · 数学 2023-10-20 Alex Burgin , Samuel Goldberg , Tamás Keleti , Connor MacMahon , Xianzhi Wang

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

逻辑 · 数学 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

We verify a conjecture of Etingof and Ostrik, stating that an algebra object in a finite tensor category is exact if and only if it is a finite direct product of simple algebras. Towards that end, we introduce an analogue of the Jacobson…

表示论 · 数学 2025-01-22 Kevin Coulembier , Mateusz Stroiński , Tony Zorman

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

计算机科学中的逻辑 · 计算机科学 2013-01-07 Zhaohua Luo

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

概率论 · 数学 2009-02-04 Carl Graham