中文
相关论文

相关论文: Strongly dependent theories

200 篇论文

We study the class of selfless C*-probability spaces introduced by Robert. It is known that a selfless tracial algebra has strict comparison and a unique trace. We prove that for separable tracial C*-algebras, selflessness is equivalent to…

算子代数 · 数学 2026-04-29 Ali Jabbari

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

逻辑 · 数学 2014-06-26 Shohei Izawa

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

组合数学 · 数学 2019-12-11 Imre Ruzsa , George Shakan , Jozsef Solymosi , Endre Szemerédi

We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…

逻辑 · 数学 2016-09-06 Apoloniusz Tyszka

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Luc Segoufin , Balder ten Cate

We prove that the expressive power of first-order logic with team semantics plus contradictory negation does not rise beyond that of first-order logic (with respect to sentences), and that the totality atoms of arity k +1 are not definable…

逻辑 · 数学 2014-03-18 Pietro Galliani

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

逻辑 · 数学 2024-05-17 Mark Kamsma

Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we…

逻辑 · 数学 2021-11-12 Hugo Jenkins

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

计算机科学中的逻辑 · 计算机科学 2010-04-13 Kai Brünnler

A subset $\mathcal X$ of a C*-algebra $\mathcal A$ is called irredundant if no $A\in \mathcal X$ belongs to the C*-subalgebra of $\mathcal A$ generated by $\mathcal X\setminus \{A\}$. Separable C*-algebras cannot have uncountable…

算子代数 · 数学 2020-07-29 Clayton Suguio Hida , Piotr Koszmider

The problem is sequence prediction in the following setting. A sequence x1,..., xn,... of discrete-valued observations is generated according to some unknown probabilistic law (measure) mu. After observing each outcome, it is required to…

机器学习 · 计算机科学 2015-10-19 Daniil Ryabko

Let $h$ be a positive integer and $A, B_1, B_2,\dots, B_h$ be finite sets in a commutative group. We bound $|A+B_1+...+B_h|$ from above in terms of $|A|, |A+B_1|,\dots,|A+B_h|$ and $h$. Extremal examples, which demonstrate that the bound is…

组合数学 · 数学 2017-02-20 Brendan Murphy , Eyvindur Ari Palsson , Giorgis Petridis

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

环与代数 · 数学 2023-11-01 Kijti Rodtes

The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…

综合数学 · 数学 2007-05-23 Paola Cattabriga

Tame abstract elementary classes are a broad nonelementary framework for model theory that encompasses several examples of interest. In recent years, progress toward developing a classification theory for them have been made. Abstract…

逻辑 · 数学 2017-10-27 Will Boney , Sebastien Vasey

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…

逻辑 · 数学 2026-05-04 Jun Le Goh , Chieu-Minh Tran

The first part of this dissertation defines "dependently typed algebraic theories", which are a strict subclass of the generalised algebraic theories (GATs) of Cartmell. We characterise dependently typed algebraic theories as finitary…

范畴论 · 数学 2021-10-07 Chaitanya Leena Subramaniam

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

逻辑 · 数学 2009-02-05 Itaï Ben Yaacov

We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…

逻辑 · 数学 2025-04-16 Alfred Dolich , John Goodrick

Let $(X,T)$ be a topological dynamical system and $\mu$ be a invariant measure, we show that $(X,\mathcal{B},\mu,T)$ is rigid if and only if there exists some subsequence $A$ of $\mathbb N$ such that $(X,T)$ is $\mu$-$A$-equicontinuous if…

动力系统 · 数学 2020-08-26 Fangzhou Cai