English
Related papers

Related papers: Contrapositionally Complemented Pseudo-Boolean Alg…

200 papers

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

We construct a denotational model of linear logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology. The negation is interpreted as the dual, linear proofs are interpreted as…

Logic in Computer Science · Computer Science 2017-01-11 Marie Kerjean

A coassociative Lie algebra is a Lie algebra equipped with a coassociative coalgebra structure satisfying a compatibility condition. The enveloping algebra of a coassociative Lie algebra can be viewed as a coalgebraic deformation of the…

Rings and Algebras · Mathematics 2013-04-25 D. -G. Wang , J. J. Zhang , G. Zhuang

FL$_\mathrm{ew}$-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FL$_\mathrm{ew}$-terms and…

Logic in Computer Science · Computer Science 2016-08-01 Zuzana Haniková , Petr Savický

The Lie algebra of Feynman graphs gives rise to two natural representations, acting as derivations on the commutative Hopf algebra of Feynman graphs, by creating or eliminating subgraphs. Insertions and eliminations do not commute, but…

High Energy Physics - Theory · Physics 2015-06-26 Alain Connes , Dirk Kreimer

We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…

Logic in Computer Science · Computer Science 2012-05-30 Robert J. Simmons , Bernardo Toninho

The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation. We demonstrate that including full…

Logic · Mathematics 2024-10-21 Fan Yang

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

In this paper, we show that coherent sets of gambles and coherent lower and upper previsions can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical…

Artificial Intelligence · Computer Science 2021-04-28 Arianna Casanova , Juerg Kohlas , Marco Zaffalon

Representations of color Hom-Lie algebras are reviewed, and it is shown that there exist a series of coboundary operators. We also introduce the notion of a color omni-Hom-Lie algebra associated to a vector space and an even invertible…

Rings and Algebras · Mathematics 2020-10-14 Abdoreza Armakan , Sergei Silvestrov

The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the…

Logic in Computer Science · Computer Science 2012-08-01 Ali Assaf , Simon Perdrix

One leading question with respect to Bi-intuitionistic logic (BINT) is, what does BINT look like across the three arcs -- logic, typed $\lambda$-calculi, and category theory -- of the Curry-Howard-Lambek correspondence? Categorically, BINT…

Logic in Computer Science · Computer Science 2017-08-22 Harley Eades , Gianluigi Bellin

Let $({\go g}\_{0},B\_{0})$ be a quadratic Lie algebra (i.e. a Lie algebra $\go{g}\_{0}$ with a non degenerate symmetric invariant bilinear form $B\_{0}$) and let $(\rho,V)$ be a finite dimensional representation of ${\go g}\_{0}$. We…

Representation Theory · Mathematics 2017-01-19 Hubert Rubenthaler

Reduction of a state of a quantum system to a subsystem gives partial quantum information about the true state of the total system. Two subalgebras A1 and A2 of B(H) are called complementary if the traceless subspaces of A1 and A2 are…

Quantum Physics · Physics 2009-11-13 Denes Petz

In the article we investigate three classes of extended Boolean Connexive Logics. Two of them are extensions of Modal and non-Modal Boolean Connexive Logics with a property of closure under an arbitrary number of negations. The remaining…

Logic · Mathematics 2024-03-20 Tomasz Jarmuzek , Jacek Malinowski , Aleksander Parol , Nicolo Zamperlin

Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs. However, CKA fundamentally misses tests, which are needed to model standard programming…

Logic in Computer Science · Computer Science 2023-02-03 Tobias Kappé , Paul Brunet , Alexandra Silva , Jana Wagemaker , Fabio Zanasi

Leibniz algebras are non skew-symmetric generalization of Lie algebras. In this paper we introduce the notion of anti-Leibniz algebras as a "non commutative version" of mock-Lie algebras. Low dimensional classification of such algebras is…

Rings and Algebras · Mathematics 2024-11-26 Safa Braiek , Taoufik Chtioui , Sami Mabrouk

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

Given a direct sum $A$ of full matrix algebras, if there is a combinatorial interpretation associated with both the dimension of $A$ and the dimensions of the irreducible $A$-modules, then this can be thought of as providing an analogue of…

Combinatorics · Mathematics 2025-07-04 John M. Campbell

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the…

Artificial Intelligence · Computer Science 2013-12-24 Joost Vennekens
‹ Prev 1 4 5 6 7 8 10 Next ›