中文
相关论文

相关论文: On sigma-entangled linear orders

200 篇论文

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

逻辑 · 数学 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

Faithful representations of regular $\ast$-rings and modular complemented lattices with involution within orthosymmetric sesquilinear spaces are studied within the framework of Universal Algebra. In particular, the correspondence between…

环与代数 · 数学 2016-04-26 Christian Herrmann , Marina Semenova

A Boolean $\sigma$-algebra $B$ is a measure algebra if and only if it is weakly distributive and uniformly concentrated.

逻辑 · 数学 2017-05-03 Thomas Jech

We discuss the Borel Tukey ordering on cardinal invariants of the continuum. We observe that this ordering makes sense for a larger class of cardinals than has previously been considered. We then provide a Borel version of a large portion…

逻辑 · 数学 2019-08-16 Samuel Coskey , Tamás Mátrai , Juris Steprāns

We study analogues of the usual Picard group for smooth analytic or non-singular algebraic varieties but instead of line bundles we study line bundles with a connection. We choose an approach which works for both cases.

代数几何 · 数学 2016-09-12 Helmut A. Hamm , Dũng Tráng Lê

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

组合数学 · 数学 2008-06-11 Vladimir Retakh , Robert Lee Wilson

We study the class of structures that, in a way, generalize various approaches to the contact relation on Boolean algebras.

A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…

环与代数 · 数学 2018-12-17 Hayden Jananthan , Suna Kim , Jeremy Kepner

We show in ZFC, that the depth of ultraproducts of Boolean Algebras may be bigger than the ultraproduct of the depth of those Boolean Algebras.

逻辑 · 数学 2007-05-23 Saharon Shelah

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…

形式语言与自动机理论 · 计算机科学 2010-02-10 Stephen L. Bloom , Zoltan Esik

We investigate free products of finite dimensional $C^*$-algebras with amalgamation over diagonal subalgebras. We look to determine under what circumstances a given free product is exact and/or nuclear. In some cases we find a description…

算子代数 · 数学 2013-07-23 Benton L. Duncan

Motivated by some recent developments in abstract theories of quadratic forms, we start to develop in this work an expansion of Linear Algebra to multivalued structures (a multialgebraic structure is essentially an algebraic structure but…

This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…

环与代数 · 数学 2009-06-26 Mahesh Rudrachar , Shrisha Rao , Amit Raj

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

逻辑 · 数学 2026-01-06 Saharon Shelah

Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…

In this paper we generalize cellular algebras by allowing different partial orderings relative to fixed idempotents. For these relative cellular algebras we classify and construct simple modules, and we obtain other characterizations in…

表示论 · 数学 2023-09-20 Michael Ehrig , Daniel Tubbenhauer

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Viktor Kuncak , Martin Rinard

In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…

In this note, we first discuss some properties of generated $\sigma$-fields and a simple approach to the construction of finite $\sigma$-fields. It is shown that the $\sigma$-field generated by a finite class of $\sigma$-distinct sets which…

概率论 · 数学 2014-08-19 P. Vellaisamy , S. Ghosh , M. Sreehari

We study the general problem of the behaviour of the continuum function in the presence of non-supercompact strongly compact cardinals.

逻辑 · 数学 2019-01-21 Arthur W. Apter , Stamatis Dimopoulos , Toshimichi Usuba