English
Related papers

Related papers: Many-valued coalgebraic logic over semi-primal var…

200 papers

We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category Set of sets to the category PMet of pseudometric spaces,…

Logic in Computer Science · Computer Science 2015-06-01 Paolo Baldan , Filippo Bonchi , Henning Kerstan , Barbara König

In this note, we consider the $d$-cluster-tilted algebras, the endomorphism algebras of $d$-cluster-tilting objects in $d$-cluster categories. We show that a tilting module over such an algebra lifts to a $d$-cluster-tilting object in this…

Representation Theory · Mathematics 2008-12-29 Pin Liu

Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…

Rings and Algebras · Mathematics 2014-04-17 Andreas Distler , Bettina Eick

We propose various methods for combining or amalgamating propositional languages and deductive systems. We make heavy use of quantales and quantale modules in the wake of previous works by the present and other authors. We also describe…

Logic · Mathematics 2022-02-02 Ciro Russo

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

This paper provides a description of an algebraic setting for the Lagrangian formalism over graded algebras and is intended as the necessary first step towards the noncommutative C-spectral sequence (variational bicomplex). A noncommutative…

High Energy Physics - Theory · Physics 2008-02-03 Alexander Verbovetsky

We present a modal logic based approach to the so-called endophysical quantum universe. In particular, we treat the problem of preferred bases and that of state reduction by employing an eclectic collection of methods including Baltag's…

Quantum Physics · Physics 2007-05-23 A. M. Lisewski

In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…

Logic in Computer Science · Computer Science 2016-07-12 Marco Peressotti

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

In this article, we try to formulate a definition of ''many-valued logical structure''. For this, we embark on a deeper study of Suszko's Thesis ($\mathbf{ST}$) and show that the truth or falsity of $\mathbf{ST}$ depends, at least, on the…

Logic · Mathematics 2026-03-03 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Logic · Mathematics 2017-01-05 Daniel Murfet

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…

Logic in Computer Science · Computer Science 2012-04-12 Alwen Tiu , Egor Ianovski , Rajeev Gore

Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep…

Logic in Computer Science · Computer Science 2025-06-03 Christoph Benzmüller

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

Experts do not always feel very, comfortable when they have to give precise numerical estimations of certainty degrees. In this paper we present a qualitative approach which allows for attaching partially ordered symbolic grades to logical…

Artificial Intelligence · Computer Science 2013-03-25 Philippe Chatalic , Christine Froidevaux

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

In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…

Logic · Mathematics 2023-06-06 Paolo Aglianò

We show how modal quantales arise as convolution algebras of functions from lr-multisemigroups that is, multisemigroups with a source map l and a target map r, into modal quantales which can be seen as weight or value algebras. In the…

Logic in Computer Science · Computer Science 2021-05-04 Uli Fahrenberg , Christian Johnsen , Georg Struth , Krzysztof Ziemiański

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio
‹ Prev 1 3 4 5 6 7 10 Next ›