English
Related papers

Related papers: Algebras and relational frames for G\"{o}del modal…

200 papers

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

In this paper, we give an extension of the J\'{o}nsson-Tarski representation theorem for both normal and non-normal modal algebras so that it preserves countably many infinitary meets and joins. To extend the J\'{o}nsson-Tarski…

Logic · Mathematics 2023-05-24 Yoshihito Tanaka

Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…

Logic · Mathematics 2023-01-18 Reijo Jaakkola , Antti Kuusisto

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

Logic · Mathematics 2023-06-05 Colin Bloomfield , Yoshihiro Maruyama

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…

Logic · Mathematics 2022-06-28 Guillermo Badia , Xavier Caicedo , Carles Noguera

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

Logic in Computer Science · Computer Science 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over…

Logic in Computer Science · Computer Science 2015-07-01 Mikolaj Bojanczyk , Igor Walukiewicz , Howard Straubing

A normal modal logic is pretransitive, if the modality corresponding to the transitive closure of an accessibility relation is expressible in it. In the present work we establish the finite model property for pretransitive generalizations…

Logic · Mathematics 2025-12-16 Lev Dvorkin

We introduce two operads which own the set of planar forests as a basis. With its usual product and two other products defined by different types of graftings, the algebra of planar rooted trees H becomes an algebra over these operads. The…

Rings and Algebras · Mathematics 2009-01-16 Loïc Foissy

We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…

Logic · Mathematics 2021-09-07 Nicholas Pischke

This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.

Logic · Mathematics 2016-05-31 Reihane Zoghifard , Massoud Pourmahdian

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Achim Blumensath

We give a brief account of the modal logic of the generic multiverse, which is a bimodal logic with operators corresponding to the relations "is a forcing extension of" and "is a ground model of". The fragment of the first relation is…

Logic · Mathematics 2012-08-28 Joel David Hamkins , Benedikt Löwe

Drawing on the classic paper by Chellas "Basic conditional logic" (1975), we propose a general algebraic framework for studying a binary operation of conditional that models universal features of the "if..., then..." connective as strictly…

Logic · Mathematics 2025-03-03 Sergio Celani , Rafał Gruszczyński , Paula Menchón

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

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara