中文
相关论文

相关论文: Semi-Cohen Boolean algebras

200 篇论文

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

代数几何 · 数学 2013-08-01 Salvador Barone

In this paper, we introduce the class of finitely semi-graded algebras which extends the connected graded algebras finitely generated in degree one. The Koszul behavior of finitely semi-graded algebras is investigated by the distributivity…

环与代数 · 数学 2019-01-23 José Oswaldo Lezama Serrano , Jaime Andrés Gómez Ortíz

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

交换代数 · 数学 2017-07-28 Danny A. J. Gomez-Ramirez , Holger Brenner

The purpose of this paper is to discuss a number of issues that crop up in the computation of Poisson brackets in field theories. This is specially important for the canonical approaches to quantization and, in particular, for loop quantum…

数学物理 · 物理学 2023-05-16 J Fernando Barbero G , Marc Basquens , Bogar Díaz , Eduardo J S Villaseñor

This work is devoted to the algebraic and arithmetic properties of Rankin-Cohen brackets allowing to define and study them in several natural situations of number theory. It focuses on the property of these brackets to be formal…

数论 · 数学 2021-02-10 Youngju Choie , François Dumas , François Martin , Emmanuel Royer

The structure of quotient Boolean algebras in terms of cardinal invariants is investigated. Some results of Gitik and Shelah regarding atomless ideals are reproved and proofs are significantly simplified.

逻辑 · 数学 2013-04-04 Ryszard Frankiewicz , Sławomir Szczepaniak

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an…

计算机科学中的逻辑 · 计算机科学 2019-04-25 Jesse Michael Han , Floris van Doorn

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Zoltan Esik , Dexter Kozen

Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…

环与代数 · 数学 2020-02-06 Sriram Nagaraj

There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.

逻辑 · 数学 2009-09-25 Thomas Jech , Saharon Shelah

Various concepts associated with quadratic algebras admit natural generalizations when the quadratic algebras are replaced by graded algebras which are finitely generated in degree 1 with homogeneous relations of degree N. Such algebras are…

量子代数 · 数学 2016-09-07 Roland Berger , Michel Dubois-Violette , Marc Wambst

In this paper, we first recall the notion of (noncommutative) Poisson conformal algebras and describe some constructions of them. Then we study the formal distribution (noncommutative) Poisson algebras and coefficient (noncommutative)…

量子代数 · 数学 2022-09-27 Jiefeng Liu , Hongyu Zhou

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

逻辑 · 数学 2022-06-15 Célia Borlido , Brett McLean

Certain types of generalized undeformed and deformed boson algebras which admit a Hopf algebra structure are introduced, together with their Fock-type representations and their corresponding $R$-matrices. It is also shown that a class of…

q-alg · 数学 2009-10-30 I Tsohantjis , A Paolucci , P D Jarvis

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.

逻辑 · 数学 2016-09-06 Thomas Jech , Saharon Shelah

Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…

环与代数 · 数学 2011-12-06 Martin Goldstern , Michael Pinsker , Saharon Shelah

We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…

环与代数 · 数学 2020-06-04 Agata Pilitowska , Anna Zamojska-Dzienio

By a "Boolean inverse semigroup" we mean an inverse semigroup whose semilattice of idempotents is a Boolean algebra. We study representations of a given inverse semigroup S in a Boolean inverse semigroup which are "tight" in a certain well…

表示论 · 数学 2010-03-16 Ruy Exel

Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…

逻辑 · 数学 2007-05-23 Jindrich Zapletal