English
Related papers

Related papers: Contrapositionally Complemented Pseudo-Boolean Alg…

200 papers

For a Lie algebra $L$ and a subalgebra $M$ of $L$ we say that a subalgebra $U$ of $L$ is a {\em supplement} to $M$ in $L$ if $L = M + U$. We investigate those Lie algebras all of whose maximal subalgebras have abelian supplements, those…

Rings and Algebras · Mathematics 2010-07-29 David A. Towers

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…

Representation Theory · Mathematics 2020-02-11 Jenny August

Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…

Logic · Mathematics 2024-04-03 Jens Kötters , Stefan E. Schmidt

We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason…

Logic in Computer Science · Computer Science 2022-10-12 Alexander V. Gheorghiu , David J. Pym

We describe completely conformal Killing or conformal Killing-Yano (CKY) $p$-forms on almost abelian metric Lie algebras. In particular we prove that if a $n$-dimensional almost abelian metric Lie algebra admits a non-parallel CKY $p$-form,…

Differential Geometry · Mathematics 2024-02-15 Cecilia Herrera , Marcos Origlia

Berwick-Evens and Lerman recently showed that the category of vector fields on a geometric stack has the structure of a Lie $2$-algebra. Motivated by this work, we present a construction of graded weak Lie $2$-algebras associated with…

Differential Geometry · Mathematics 2023-07-07 Zhuo Chen , Honglei Lang , Zhangju Liu

AIMS: The separation of foreground contamination from cosmic microwave background (CMB) observations is one of the most challenging and important problem of digital signal processing in Cosmology. In literature, various techniques have been…

Astrophysics · Physics 2015-05-13 R. Vio , P. Andreani

Connectivity is a homotopy invariant property of separable C*-algebras which has three notable consequences: absence of nontrivial projections, quasidiagonality and a more geometric realization of KK-theory for nuclear C*-algebras using…

Operator Algebras · Mathematics 2019-10-03 Marius Dadarlat , Ulrich Pennig

This article introduces the conjecture that "mathematics, logic and related disciplines may usefully be understood as information compression (IC) by 'multiple alignment', 'unification' and 'search' (ICMAUS)". As a preparation for the two…

General Mathematics · Mathematics 2007-05-23 J Gerard Wolff

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…

Information Theory · Computer Science 2021-01-01 Juerg Kohlas , Juerg Schmid

Concurrent Kleene Algebra is an elegant tool for equational reasoning about concurrent programs. An important feature of concurrent programs that is missing from CKA is the ability to restrict legal interleavings. To remedy this we extend…

Logic in Computer Science · Computer Science 2020-05-07 Paul Brunet , David Pym

The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…

Logic in Computer Science · Computer Science 2014-08-18 Rob Arthan , Paulo Oliva

We introduce and develop a topological semantics of conservativity logics and interpretability logics. We prove the topological compactness theorem of consistent normal extensions of the conservativity logic $\mathbf{CL}$ by extending…

Logic · Mathematics 2021-09-14 Sohei Iwata , Taishi Kurahashi

To appear in Theory and Practice of Logic Programming (TPLP). In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-founded model is associated to a justification represented as an…

Logic in Computer Science · Computer Science 2016-05-11 Pedro Cabalar , Jorge Fandinno

Large language models exhibit systematic limitations in structured logical reasoning: they conflate hypothesis generation with verification, cannot distinguish conjecture from validated knowledge, and allow weak reasoning steps to propagate…

Artificial Intelligence · Computer Science 2026-04-20 Sankalp Gilda , Shlok Gilda

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente

The note is concerned with inductive systems of Toeplitz algebras and their $*$-homomorphisms over arbitrary partially ordered sets. The Toeplitz algebra is the reduced semigroup $C^*$-algebra for the additive semigroup of non-negative…

Operator Algebras · Mathematics 2019-05-17 E. V. Lipacheva

Effect algebras form a formal algebraic description of the structure of the so-called effects in a Hilbert space which serves as an event-state space for effects in quantum mechanics. This is why effect algebras are considered as logics of…

Logic · Mathematics 2019-08-16 Ivan Chajda , Helmut Länger

The ability to generalise from a small number of examples is a fundamental challenge in machine learning. To tackle this challenge, we introduce an inductive logic programming (ILP) approach that combines negation and predicate invention.…

Artificial Intelligence · Computer Science 2025-06-23 David M. Cerna , Andrew Cropper
‹ Prev 1 3 4 5 6 7 10 Next ›