English
Related papers

Related papers: The Semiring Properties of Boolean Propositional A…

200 papers

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…

Information Theory · Computer Science 2021-01-01 Juerg Kohlas , Juerg Schmid

Let $R\subset F$ be an extension of real closed fields and ${\mathcal S}(M,R)$ the ring of (continuous) semialgebraic functions on a semialgebraic set $M\subset R^n$. We prove that every $R$-homomorphism $\varphi:{\mathcal S}(M,R)\to F$ is…

Algebraic Geometry · Mathematics 2015-09-16 Jose F. Fernando

The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and…

Formal Languages and Automata Theory · Computer Science 2021-03-16 Ziyuan Gao , Sanjay Jain , Ji Qi , Philipp Schlicht , Frank Stephan , Jacob Tarr

A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…

Rings and Algebras · Mathematics 2024-11-20 Peter F. Faul , Amartya Goswami , Gideo Joubert , Graham Manuell

This paper is a further contribution to the extensive study by a number of authors of the subalgebra lattice of a Lie algebra. It is shown that, in certain circumstances, including for all solvable algebras, for all Lie algebras over…

Rings and Algebras · Mathematics 2008-06-19 David A. Towers

We construct a faithful representation of the semiring of all order-preserving decreasing transformations of a chain with $n+1$ elements by Boolean upper triangular $n\times n$-matrices.

Rings and Algebras · Mathematics 2026-01-14 Mikhail Volkov

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

Logic in Computer Science · Computer Science 2015-06-25 Baltasar Trancón y Widemann , Michael Hauhs

The purpose of this paper is to introduce Hom-alternative algebras and Hom-Jordan algebras. We discuss some of their properties and provide construction procedures using ordinary alternative algebras or Jordan algebras. Also, we show that a…

Rings and Algebras · Mathematics 2009-09-03 Abdenacer Makhlouf

An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…

Rings and Algebras · Mathematics 2022-03-16 J. P. Fatelo , N. Martins-Ferreira

In this note, we observe a relation between dialgebras (in particular, Leibniz algebras) and conformal algebras. The purpose is to show how the methods of conformal algebras help solving problems on dialgebras, and, conversely, how the…

Quantum Algebra · Mathematics 2015-09-17 Pavel Kolesnikov

We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…

Logic · Mathematics 2023-07-04 Paolo Lipparini

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…

Logic in Computer Science · Computer Science 2011-06-28 J. A. Bergstra , A. Ponse

The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…

Quantum Algebra · Mathematics 2011-07-08 Tomasz Brzeziński

Boolean spaces with internal semigroups generalize profinite semigroups and are pertinent for the recognition of not-necessarily regular languages. Via recognition, the study of existential quantification in logic on words amounts to the…

General Topology · Mathematics 2019-01-18 Célia Borlido , Mai Gehrke

It is well known that Barr and Beck's definition of comonadic homology makes sense also with a functor of coefficients taking values in a semi-abelian category instead of an abelian one. The question arises whether such a homology theory…

Algebraic Topology · Mathematics 2009-04-16 Julia Goedecke , Tim Van der Linden

This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation,…

Logic · Mathematics 2016-04-19 K. Dosen , Z. Petric

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

Rings and Algebras · Mathematics 2021-02-17 Fernando Martin-Maroto , Gonzalo G. de Polavieja

We investigate ideal-semisimple and congruence-semisimple semirings. We give several new characterizations of such semirings using e-projective and e-injective semimodules. We extend several characterizations of semisimple rings to (not…

Rings and Algebras · Mathematics 2019-08-02 Jawad Y. Abuhlail , Rangga Ganzar Noegraha

In this work, the notion of partial representation of a Hopf algebra is introduced and its relationship with partial actions of Hopf algebras is explored. Given a Hopf algebra $H$, one can associate it to a Hopf algebroid $H_{par}$ which…

Rings and Algebras · Mathematics 2013-09-23 Marcelo Muniz S. Alves , Eliezer Batista , Joost Vercruysse

The aim of this paper is to present a very simple set of conditions, necessary for the management of knowledge of a poset $T$ of two agents, which are partially ordered by the capabilities available in the system. We build up a formal…

Logic in Computer Science · Computer Science 2014-07-04 Luisa Iturrioz