English
Related papers

Related papers: Representation theorems in modal logic using algeb…

200 papers

It is proved that every prevariety of algebras is categorically equivalent to a "prevariety of logic", i.e., to the equivalent algebraic semantics of some sentential deductive system. This allows us to show that no nontrivial equation in…

Logic · Mathematics 2019-02-13 T. Moraschini , J. G. Raftery

We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate…

Logic in Computer Science · Computer Science 2018-02-06 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Logic · Mathematics 2019-08-06 Matthias Baaz , Richard Zach

We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…

Logic · Mathematics 2026-03-19 Zalán Gyenis , Zalán Molnár , Övge Öztürk

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In…

Logic in Computer Science · Computer Science 2024-12-03 Andrea De Domenico , Ali Farjami , Krishna Manoorkar , Alessandra Palmigiano , Mattia Panettiere , Xiaolong Wang

We study the representation theory of graded Hecke algebras, starting from scratch and focusing on representations that are obtained with induction from a discrete series representation of a parabolic subalgebra. We determine all…

Representation Theory · Mathematics 2012-11-08 Maarten Solleveld

We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…

Logic · Mathematics 2020-02-27 Nick Bezhanishvili , Almudena Colacito , Dick de Jongh

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Rings and Algebras · Mathematics 2010-04-13 Zur Izhakian , John Rhodes , Benjamin Steinberg

The First and Second Representation Theorem for sign-indefinite quadratic forms are extended. We include new cases of unbounded forms associated with operators that do not necessarily have a spectral gap around zero. The kernel of the…

Functional Analysis · Mathematics 2015-09-25 Stephan Schmitz

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Logic in Computer Science · Computer Science 2016-11-23 Corina Cirstea , Clemens Kupke , Dirk Pattinson

Given a class $\mathcal C$ of models, a binary relation ${\mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $\mathcal C$ in $L$ where the modal operator is…

Logic · Mathematics 2019-10-22 Denis I. Saveliev , Ilya B. Shapirovsky

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…

Quantum Physics · Physics 2014-12-31 Daniel Marsden

We start with definitions of the general notions of the theory of $\Bbb Z_{2}$-graded algebras. Then we consider theory of inductive families of $\Bbb Z_{2}$-graded semisimple finite-dimensional algebras and its representations in the…

Representation Theory · Mathematics 2008-01-17 A. M. Vershik , A. N. Sergeev

We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…

Logic in Computer Science · Computer Science 2024-08-07 Alexander Kurz , Wolfgang Poiger , Bruno Teheux

We demonstrate that the notions of derivative representation of a Lie algebra on a vector bundle, of semi-linear representations of a Lie group on a vector bundle, and related concepts, may be understood in terms of representations of Lie…

Differential Geometry · Mathematics 2007-05-23 Y. Kosmann-Schwarzbach , K. C. H. Mackenzie

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

We classify the propositional modal validities arising from the category of sets under its natural classes of morphisms. The resulting validities depend on the morphism class, the size of the world, and the permitted substitution instances.…

Logic · Mathematics 2026-04-29 Wojciech Aleksander Wołoszyn

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…

Artificial Intelligence · Computer Science 2009-05-18 Christoph Benzmueller , Lawrence C. Paulson
‹ Prev 1 8 9 10 Next ›