English
Related papers

Related papers: Continuous Algebra: Algebraic Semantics for Contin…

200 papers

C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective. Intuitionistically, however, the strict implication has greater…

Logic in Computer Science · Computer Science 2017-10-31 Tadeusz Litak , Albert Visser

Weyl modules were originally defined for affine Lie algebras by Chari and Pressley in \cite{CP}. In this paper we extend the notion of Weyl modules for a Lie algebra $\mathfrak{g} \otimes A$, where $\mathfrak{g}$ is any Kac-Moody algebra…

Representation Theory · Mathematics 2015-01-21 S. Eswara Rao , V. Futorny , Sachin S. Sharma

In this short paper, we advocate for the idea that continuation-based intermediate languages correspond to intermediate logics. The goal of intermediate languages is to serve as a basis for compiler intermediate representations, allowing to…

Logic in Computer Science · Computer Science 2026-01-14 Jean Caspar , Guillaume Munch-Maccagnoni

We consider C-graded vertex algebras, which are vertex algebras V with a C-grading such that V is an admissible V-module generated by 'lowest weight vectors'. We show that such vertex algebras have a 'good' representation theory in the…

Quantum Algebra · Mathematics 2015-06-16 Rob Laber , Geoffrey Mason

In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…

Analysis of PDEs · Mathematics 2023-10-30 Xiangsheng Xu

The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem…

Logic in Computer Science · Computer Science 2019-03-14 Dimitar P. Guelev

We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…

Logic in Computer Science · Computer Science 2025-05-22 Francisco Aragão

Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the…

Logic in Computer Science · Computer Science 2023-02-03 Jana Wagemaker , Marcello Bonsangue , Tobias Kappé , Jurriaan Rot , Alexandra Silva

In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…

Rings and Algebras · Mathematics 2025-01-20 Kostiantyn Iusenko , John MacQuarrie

We solve a class of lifting problems involving approximate polynomial relations (soft polynomial relations). Various associated C*-algebras are therefore projective. The technical lemma we need is a new manifestation of Akemann and…

Operator Algebras · Mathematics 2014-01-14 Terry A. Loring , Tatiana Shulman

We study the representation theory of the algebraic Toeplitz algebra $R={\mathbb K}\langle x,y\rangle/\langle xy-1\rangle$, give a few new structure and homological theorems, completely determine one-sided ideals and survey and re-obtain…

Rings and Algebras · Mathematics 2016-03-02 Miodrag C Iovanov , Alexander Sistko

Quantitative algebras are algebras enriched in the category $\mathsf{Met}$ of metric spaces so that all operations are nonexpanding. Mardare, Plotkin and Panangaden introduced varieties (aka $1$-basic varieties) as classes of quantitative…

Category Theory · Mathematics 2023-01-04 Jiří Adámek , Matěj Dostál , Jiří Velebil

In this paper we investigate a *-algebra $\cX$ of fractions associated with a unital complex *-algebra $\cA$. The algebra $\cX$ and its Hilbert space representations are used to prove abstract noncommutative strict Positivstellens\"atze for…

Operator Algebras · Mathematics 2009-03-17 Konrad Schmuedgen

Let $ \mathbb{A}$ be a cellular algebra over a field $\mathbb{F}$ with a decomposition of the identity $ 1_{\mathbb{A}} $ into orthogonal idempotents $ e_i$, $i \in I$ (for some finite set $I$) satisfying some properties. We describe the…

Representation Theory · Mathematics 2017-01-31 Mufida M. Hmaida

A weakly complete finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The proof is carried out using a non trivial extension of the Fagin-Halpern-Megiddo technique together with three Henkin style…

Logic · Mathematics 2016-01-14 P. Mateus , A. Sernadas

We study the question of whether or not contractive representations of logmodular algebras are completely contractive. We prove that a 2-contractive representation of a logmodular algebra extends to a positive map on the enveloping…

Operator Algebras · Mathematics 2010-03-24 Vern I. Paulsen , Mrinal Raghupathi

P\l onka sums consist of a general construction that provides structural description for algebras in regularized varieties, whose examples range from Clifford semigroups to many algebras of logic including involutive bisemilattices, Bochvar…

Logic · Mathematics 2026-02-09 S. Bonzio , G. Zecchini

This comparative survey explores three formal approaches to reasoning with partly true statements and degrees of truth, within the family of {\L}ukasiewicz logic. These approaches are represented by infinite-valued {\L}ukasiewicz logic…

Logic in Computer Science · Computer Science 2021-12-14 Zuzana Haniková

The main aim of this article is to study tense MV-algebras which are just MV-algebras with new unary operations $G$ and $H$ which express a universal time quantifiers. Tense MV-algebras were introduced by D. Diagonescu and G. Georgescu.…

Commutative Algebra · Mathematics 2013-05-16 Michal Botur , Jan Paseka

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
‹ Prev 1 8 9 10 Next ›