English
Related papers

Related papers: Monadic NM-algebras

200 papers

Codensity monads provide a universal method to generate complex monads from simple functors. Recently, a wide range of important monads in logic, denotational semantics, and probabilistic computation, such as several incarnations of the…

Logic in Computer Science · Computer Science 2026-03-10 Fabian Lenke , Nico Wittrock , Stefan Milius , Henning Urbat

The problem is the classification of the ideals of ``free differential algebras", or the associated quotient algebras, the q-algebras; being finitely generated, unital C-algebras with homogeneous relations and a q-differential structure.…

Quantum Algebra · Mathematics 2007-05-23 Christian Fronsdal

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

Category Theory · Mathematics 2019-03-19 Soichiro Fujii

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

Logic · Mathematics 2020-11-11 Michael C. Laskowski , Caroline A. Terry

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

Logic · Mathematics 2026-01-21 Ivo Düntsch , Rafał Gruszczyński , Paula Menchón

The paper is essentially a continuation of B.Plotkin, G.Zhitomirski, "Some logical invariants of algebras and logical relations between algebras", St.Peterburg Math. J., {19:5}, (2008) 859 -- 879, whose main notion is that of…

Logic · Mathematics 2009-04-26 Plotkin Boris

A general theory of the Frolicher-Nijenhuis and Schouten-Nijenhuis brackets in the category of modules over a commutative algebra is described. Some related structures and (co)homology invariants are discussed, as well as applications to…

Differential Geometry · Mathematics 2010-01-30 Iosif Krasil'shchik

Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…

Logic in Computer Science · Computer Science 2007-05-23 André Hirschowitz , Marco Maggesi

Algebraic theories, sometimes called equational theories, are syntactic notions given by finitary operations and equations, such as monoids, groups, and rings. There is a well-known category-theoretic treatment of them that algebraic…

Category Theory · Mathematics 2026-03-31 Yuto Kawase

We address the problem of supporting empirical probabilities in monadic logic databases. Though the semantics of multivalued logic programs has been studied extensively, the treatment of probabilities as results of statistical findings has…

Artificial Intelligence · Computer Science 2013-03-25 Raymond T. Ng , V. S. Subrahmanian

Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…

Logic in Computer Science · Computer Science 2016-12-27 Wataru Hino

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

Quantum Algebra · Mathematics 2007-05-23 Hans Plesner Jakobsen , Søren Jøndrup

In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…

Quantum Physics · Physics 2014-04-24 Hector Freytes , Christian de Ronde , Graciela Domenech

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

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

Logical relations and their generalizations are a fundamental tool in proving properties of lambda-calculi, e.g., yielding sound principles for observational equivalence. We propose a natural notion of logical relations able to deal with…

Logic in Computer Science · Computer Science 2009-09-29 Jean Goubault-Larrecq , Slawomir Lasota , David Nowak

Leibniz algebras are certain generalization of Lie algebras. It is natural to generalize concepts in Lie algebras to Leibniz algebras and investigate whether the corresponding results still hold. In this paper we introduce the notion of…

Rings and Algebras · Mathematics 2020-02-03 Kristen Boyle , Kailash C. Misra , Ernie Stitzinger

Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and…

Logic in Computer Science · Computer Science 2025-10-14 Maximilian R. P. von Liechtenstein

A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…

Logic in Computer Science · Computer Science 2025-11-14 Kenji Tokuo
‹ Prev 1 3 4 5 6 7 10 Next ›