English
Related papers

Related papers: The Semiring Properties of Boolean Propositional A…

200 papers

The relationship between fuzzy algebras and semirings is explored with fuzzy algebra operators replacing the arithmetic operators of semirings. A new class of fuzzy structures which are similar to semirings is defined. Results of partial…

Rings and Algebras · Mathematics 2010-03-15 V. S. S. Kartikeya Vanamali , Shrisha Rao

Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…

Logic · Mathematics 2024-01-18 Wenxi Li , Zhongzhi Wang

We describe an explicit semi-algebraic partition for the complement of a real hyperplane arrangement such that each piece is contractible and so that the pieces form a basis of Borel-Moore homology. We also give an explicit correspondence…

Geometric Topology · Mathematics 2011-05-18 Ko-Ki Ito , Masahiko Yoshinaga

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Rings and Algebras · Mathematics 2010-04-13 Zur Izhakian , John Rhodes , Benjamin Steinberg

In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…

Logic · Mathematics 2009-06-12 Bernd R. Schuh

This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…

Logic · Mathematics 2020-06-11 Tommaso Flaminio , Lluis Godo , Hykel Hosni

A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…

Combinatorics · Mathematics 2025-10-17 Nathaniel Vaduthala

We develop the basic constructions of homological algebra in the (appropriately defined) unbounded derived categories of modules over algebras over coalgebras over noncommutative rings (which we call semialgebras over corings). We define…

Category Theory · Mathematics 2014-05-12 Leonid Positselski

We present the algebra of assume-guarantee (AG) contracts. We define contracts, provide new as well as known operations, and show how these operations are related. Contracts are functorial: any Boolean algebra has an associated contract…

Logic in Computer Science · Computer Science 2023-09-19 Inigo Incer , Albert Benveniste , Alberto Sangiovanni-Vincentelli

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…

Logic · Mathematics 2009-05-19 Jaap van Oosten

The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…

Logic · Mathematics 2023-06-13 Paolo Lipparini

Domain operations on semirings have been axiomatised in two different ways: by a map from an additively idempotent semiring into a boolean subalgebra of the semiring bounded by the additive and multiplicative unit of the semiring, or by an…

Logic in Computer Science · Computer Science 2021-03-23 Uli Fahrenberg , Christian Johansen , Georg Struth , Krzysztof Ziemiánski

In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof…

Logic · Mathematics 2011-12-06 Cheng Hao

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…

Logic · Mathematics 2022-06-15 Célia Borlido , Brett McLean

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

Logic · Mathematics 2014-02-10 Matteo Viale , Giorgio Audrito , Silvia Steila

The relationship between Heyting algebras (HA) and semirings is explored. A new class of HAs called Symmetric Heyting algebras (SHAs) is proposed, and a necessary condition on SHAs to be consider semirings is given. We define a new…

Rings and Algebras · Mathematics 2016-09-22 Amit Raj , Shrisha Rao , Mahesh Rudrachar

In this paper, we introduce homological structure theory of semirings and CP-semirings---semirings all of whose cyclic semimodules are projective. We completely describe semisimple, Gelfand, subtractive, and anti-bounded, CP-semirings. We…

Rings and Algebras · Mathematics 2015-09-11 S. N. Il'in , Y. Katsov , T. G. Nam

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

Logic in Computer Science · Computer Science 2022-04-25 Takeshi Tsukada , Kazuyuki Asada

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian
‹ Prev 1 2 3 10 Next ›