English
Related papers

Related papers: A general framework for product representations: b…

200 papers

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

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…

Rings and Algebras · Mathematics 2016-04-26 Christian Herrmann , Marina Semenova

Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a new theory required for each variation of the language or of…

Logic in Computer Science · Computer Science 2024-05-17 Sergey Goncharov , Stefan Milius , Stelios Tsampas , Henning Urbat

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Plo\v{s}\v{c}ica. The standard representations of complete ortholattices and complete perfect Heyting…

Logic · Mathematics 2024-02-28 Wesley H. Holliday

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

Logic · Mathematics 2016-08-17 Eduardo Mizraji

The double point relation defines a natural theory of algebraic cobordism for bundles on varieties. We construct a simple basis (over the rationals) of the corresponding cobordism groups over Spec(C) for all dimensions of varieties and…

Algebraic Geometry · Mathematics 2010-02-21 Y. -P. Lee , R. Pandharipande

Bilattices provide an algebraic tool with which to model simultaneously knowledge and truth. They were introduced by Belnap in 1977 in a paper entitled \emph{How a computer should think}. Belnap argued that instead of using a logic with two…

Logic · Mathematics 2019-05-07 Andrew Craig , Brian A. Davey , Miroslav Haviar

We apply the method of iterated inflations to show that the wreath product of a cellular algebra with a symmetric group is cellular, and obtain descriptions of the cell and simple modules together with a semisimplicity condition for such…

Representation Theory · Mathematics 2019-06-25 Reuben Green

We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…

Logic · Mathematics 2021-01-19 Antonio Bucciarelli , Antonino Salibra

This note concerns bounded derivations on maximal triangular operator algebras on a Hilbert space. Given any bounded derivation $\delta$ on a maximal triangular algebra whose invariant lattice is continuous at 1, an operator which is shown…

Operator Algebras · Mathematics 2025-08-12 Mark Spivack

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

Logic in Computer Science · Computer Science 2026-03-17 Jan Laštovička

We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…

Logic · Mathematics 2025-01-17 Amir Farahmand Parsa , Meghdad Ghari

The aim of the paper is to discuss the relations between the three kinds of objects named in the title. In a sense, this is a survey of such relations; however, some new directions are also considered. This relates, especially, to sections…

General Mathematics · Mathematics 2007-05-23 B. Plotkin

We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…

Logic in Computer Science · Computer Science 2022-07-26 Todd Schmid , Wojciech Rozowski , Alexandra Silva , Jurriaan Rot

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…

Logic in Computer Science · Computer Science 2026-05-27 Vijay D'Silva , Alessandra Palmigiano , Apostolos Tzimoulis , Caterina Urban

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

We characterize those varieties of universal algebras where every split epimorphism considered as a map of sets is a product projection. In addition we obtain new characterizations of protomodular, unital and subtractive varieties as well…

Category Theory · Mathematics 2012-08-13 James R. A. Gray , Nelson Martins-Ferreira

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

The Mal'tsev product of two varieties of similar algebras is always a quasivariety. We consider the question of when this quasivariety is a variety. The main result asserts that if $\mathcal{V}$ is a strongly irregular variety with no…

Rings and Algebras · Mathematics 2026-04-01 Clifford Bergman , Tomasz Penza , Anna B. Romanowska