English
Related papers

Related papers: Goldblatt-Thomason Theorems for Modal Intuitionist…

200 papers

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

Modal logic with propositional quantifiers (i.e. second-order propositional modal logic (SOPML)) has been considered since the early time of modal logic. Its expressive power and complexity are high, and its van-Benthem-Rosen theorem and…

Logic in Computer Science · Computer Science 2021-10-19 Zhiguang Zhao

We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…

Logic · Mathematics 2021-09-14 Wesley Fussner , Gavin St. John

In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…

Logic in Computer Science · Computer Science 2022-06-16 Chun-Yu Lin , Churn-Jung Liau

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Logic · Mathematics 2026-01-16 Georgi Nakov , Davide Emilio Quadrellaro

We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…

Logic in Computer Science · Computer Science 2016-02-03 Fredrik Dahlqvist , David Pym

Thanks to Hrushovski-Loeser's work on motivic Milnor fibers, we give a model-theoretic proof for the motivic Thom-Sebastiani theorem in the case of regular functions. Moreover, slightly extending of Hrushovski-Loeser's construction adjusted…

Algebraic Geometry · Mathematics 2014-05-29 Le Quy Thuong

An algebraic deformation theory of dialgebra morphisms is obtained.

Rings and Algebras · Mathematics 2008-12-07 Donald Yau

We develop a partial Hopf-Galois theory for partial H-module algebras and we recover analogs of classical results for Hopf algebras.

Quantum Algebra · Mathematics 2025-06-24 Felipe Castro , Daiane Freitas , Antonio Paques , Glauber Quadros , Thaísa Tamusiunas

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

We give a uniform proof of a significant part of the Cachazo-Douglas-Seiberg-Witten conjecture by using topology and geometry of infinite Grassmannians.

Algebraic Geometry · Mathematics 2007-05-23 Shrawan Kumar

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…

Logic in Computer Science · Computer Science 2018-10-15 Giovanna D'Agostino

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.

Combinatorics · Mathematics 2007-12-04 Kouachi Said , Abdelmalek Salem , Rebiai Belgacem

We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.

Logic in Computer Science · Computer Science 2014-09-15 Damien Doligez , Jael Kriener , Leslie Lamport , Tomer Libal , Stephan Merz

We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…

Category Theory · Mathematics 2016-03-29 Caio de Andrade Mendes , Hugo Luiz Mariano

We outline a proof of the categorical geometric Langlands conjecture for GL(2), as formulated in reference [AG], modulo a number of more tractable statements that we call Quasi-Theorems.

Algebraic Geometry · Mathematics 2014-11-13 Dennis Gaitsgory

The paper is devoted to the introduction of natural deduction systems for some weak subintuitionistic logics, along with proofs of normalization theorems for these systems.

Logic · Mathematics 2024-12-03 Fatemeh Shirmohammadzadeh Maleki

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure. We establish a…

Logic · Mathematics 2018-10-15 I. Chajda , H. Länger , J. Paseka