English
Related papers

Related papers: Term satisfiability in FL$_\mathrm{ew}$-algebras

200 papers

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…

Logic in Computer Science · Computer Science 2010-03-30 Arne Meier , Thomas Schneider

In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive integer functions, without actually providing their closed…

Logic in Computer Science · Computer Science 2007-05-23 Michael R. Dransfield , Victor W. Marek , Miroslaw Truszczynski

Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…

Logic · Mathematics 2025-07-16 Benjamin Merlin Bumpus , Zoltan A. Kocsis

A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…

Logic · Mathematics 2021-07-13 T. Moraschini

For a locally compact group $G$, the first-named author considered the closed subspace $a_0(G)$ which is generated by the pure positive definite functions. In many cases $a_0(G)$ is itself an algebra. We illustrate using Heisenburg groups…

Functional Analysis · Mathematics 2012-08-13 Yin-Hei Cheng , Brian E. Forrest , Nico Spronk

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

Logic in Computer Science · Computer Science 2024-12-02 Daumantas Kojelis

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…

Logic in Computer Science · Computer Science 2017-07-19 Arne Meier , Thomas Schneider

The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…

Quantum Physics · Physics 2026-03-02 Anuj Dawar , Nihil Shah

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…

Logic · Mathematics 2026-03-24 Giuliano Rosella , Sara Ugolini

We establish an Esakia duality for the categories of temporal Heyting algebras and temporal Esakia spaces. This includes a proof of contravariant equivalence and a congruence/filter/closed-upset correspondence. We then study two notions of…

Logic · Mathematics 2025-05-16 David Quinn Alvarez

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Logic in Computer Science · Computer Science 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

Let G be a locally compact group, and let A(G) and B(G) denote its Fourier and Fourier-Stieltjes algebras. These algebras are dual objects of the group and measure algebras, L^1(G) and M(G), in a sense which generalizes the Pontryagin…

Functional Analysis · Mathematics 2010-07-28 Nico Spronk

A finite algebra $\bA=\alg{A;\cF}$ is \emph{dualizable} if there exists a discrete topological relational structure $\BA=\alg{A;\cG;\cT}$, compatible with $\cF$, such that the canonical evaluation map $e\_{\bB}\colon \bB\to \Hom(…

Rings and Algebras · Mathematics 2015-03-10 Pierre Gillibert

A finite W-algebra is an associative algebra constructed from a semisimple Lie algebra and its nilpotent element. In this survey we review recent developments in the representation theory of W-algebras. We emphasize various interactions…

Representation Theory · Mathematics 2010-03-31 Ivan Losev

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

Logic · Mathematics 2021-01-20 Christian Herrmann

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Plo\v{s}\v{c}ica. The standard representations of complete ortholattices and complete perfect Heyting…

Logic · Mathematics 2024-02-28 Wesley H. Holliday

A compatible $L_\infty$-algebra is a graded vector space together with two compatible $L_\infty$-algebra structures on it. Given a graded vector space, we construct a graded Lie algebra whose Maurer-Cartan elements are precisely compatible…

Rings and Algebras · Mathematics 2021-11-29 Apurba Das

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

Algebraic Topology · Mathematics 2025-05-08 Victor Roca i Lucio

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…

Logic in Computer Science · Computer Science 2021-04-21 A. R. Balasubramanian , Timo Lang , Revantha Ramanayake

In this paper we consider the structure of general quantum W-algebras. We introduce the notions of deformability, positive-definiteness, and reductivity of a W-algebra. We show that one can associate a reductive finite Lie algebra to each…

High Energy Physics - Theory · Physics 2009-10-22 P. Bowcock , G Watts
‹ Prev 1 2 3 10 Next ›