English
Related papers

Related papers: Algebraic modal correspondence: Sahlqvist and beyo…

200 papers

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…

Logic in Computer Science · Computer Science 2021-08-20 Jonne Iso-Tuisku , Antti Kuusisto

The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…

Logic in Computer Science · Computer Science 2007-05-23 François Bry

In the present paper, we continue the research in \cite{Zh21c} to develop the Sahlqvist-type completeness theory for hybrid logic with satisfaction operators and downarrow binders $\mathcal{L}(@, \downarrow)$. We define the class of…

Logic in Computer Science · Computer Science 2022-07-05 Zhiguang Zhao

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

Based on the Bohr's correspondence principle it is shown that relativistic mechanics and quantum mechanics may be considered as generalizations of classical mechanics. A comparative description of relativistic and classical mechanics is…

Physics Education · Physics 2007-05-23 Yu. I. Bogdanov

This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also…

Computation and Language · Computer Science 2020-09-23 Richard Moot , Symon Stevens-Guille

Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer…

Artificial Intelligence · Computer Science 2023-12-15 Christian Antic

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

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

In this work, a novel quaternary algebra has been proposed that can be used to implement an arbitrary quaternary logic function in more than one systematic ways. The proposed logic has evolved from and is closely related to the Boolean…

Hardware Architecture · Computer Science 2017-12-21 Ifat Jahangir , Anindya Das , Masud Hasan

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

Artificial Intelligence · Computer Science 2020-12-22 Angelos Charalambidis , Giorgos Papadimitriou , Panos Rondogiannis , Antonis Troumpoukis

Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…

Quantum Physics · Physics 2009-02-19 Decio Krause , Hercules de Araujo Feitosa

We study the correspondence theory of intuitionistic modal logic in modal Fairtlough-Mendler semantics (modal FM semantics) \cite{FaMe97}, which is the intuitionistic modal version of possibility semantics \cite{Ho16}. We identify the…

Logic · Mathematics 2022-10-06 Zhiguang Zhao

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

This paper develops a formal account of causal explanation, grounded in a theory of conversational pragmatics, and inspired by the interventionist idea that explanation is about asking and answering what-if-things-had-been-different…

Multiagent Systems · Computer Science 2025-05-07 Jacqueline Harding , Tobias Gerstenberg , Thomas Icard

The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…

Formal Languages and Automata Theory · Computer Science 2019-03-20 Ondřej Klíma , Libor Polák

These are lecture notes for an introductory course on Nichols algebras. As a main reference, I work with the book by Heckenberger and Schneider, but I want to take a distinct categorical perspective and try to develop the topic for an…

Quantum Algebra · Mathematics 2026-02-03 Simon D. Lentner

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
‹ Prev 1 3 4 5 6 7 10 Next ›