中文
相关论文

相关论文: Words and Dominions

200 篇论文

Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…

范畴论 · 数学 2023-06-21 Zalán Gyenis , Alexa Gopaulsingh , Övge Öztürk

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

环与代数 · 数学 2007-05-23 Vesselin Drensky , Lakhdar Hammoudi

We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…

计算复杂性 · 计算机科学 2015-06-04 Mario Szegedy , Yixin Xu

In the first part, we prove that the dominion (in the sense of Isbell) of a subgroup of a finitely generated nilpotent group is trivial in the category of all nilpotent groups. In the second part, we show that the dominion of a subgroup of…

群论 · 数学 2007-05-23 Arturo Magidin

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

计算机科学中的逻辑 · 计算机科学 2012-10-10 Domenico Cantone , Cristiano Longo

Order unit property of a positive element in a $C^{*}$-algebra is defined. It is proved that precisely projections satisfy this order theoretic property. This way, unital hereditary $C^{*}$-subalgebras of a $C^{*}$-algebra are…

算子代数 · 数学 2007-05-23 Anil K. Karn

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

泛函分析 · 数学 2019-10-03 Colin C. Graham

Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over…

计算机科学中的逻辑 · 计算机科学 2023-11-22 Eugenia Ternovska

We give a necessary and sufficient condition for a type of generalized power series to be algebraic over the ring of power series with coefficients in a finite field. This result extend a classical theorem of Huang-Stefanescu.

代数几何 · 数学 2019-05-21 V. M. Saavedra

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

逻辑 · 数学 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

数论 · 数学 2025-02-27 Jaroslav Hancl , Mathias L. Laursen , Simon Kristensen

Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…

计算机科学中的逻辑 · 计算机科学 2026-04-20 Murdoch J. Gabbay

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

组合数学 · 数学 2010-08-30 P. Blasiak

If $\A$ is an algebra over a field $\F$ and $\s$ is a generating set of $\A$, the length of $\s$ indicates the maximal length needed to express an arbitrary element of $\A$ as a linear combination of words in the elements of $\s$. The…

环与代数 · 数学 2021-10-25 O. V. Markova , C. Martínez , R. L. Rodrigues

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

逻辑 · 数学 2020-11-11 Michael C. Laskowski , Caroline A. Terry

Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…

环与代数 · 数学 2007-05-23 A. Leroy , A. Ozturk

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

逻辑 · 数学 2009-05-19 Jaap van Oosten

A simple sufficient condition for certain cyclic algebras of odd degree d to be split is presented. It employs certain binary forms of degree d and the values they represent. A similar sufficient condition for certain Albert algebras not to…

环与代数 · 数学 2007-05-23 S. Pumpluen

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

计算机科学中的逻辑 · 计算机科学 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

群论 · 数学 2016-09-07 Alexander A. Mikhalev , Vladimir Shpilrain , Jie-Tai Yu