English
Related papers

Related papers: Expressiveness of the modal mu-calculus on monoton…

200 papers

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas.…

Logic in Computer Science · Computer Science 2019-03-14 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees,…

Logic in Computer Science · Computer Science 2015-01-29 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…

Logic in Computer Science · Computer Science 2019-05-17 Achim Blumensath , Felix Wolf

We explore an inquisitive modal logic designed to reason about neighborhood models. This logic is based on an inquisitive strict conditional operator, which quantifies over neighborhoods, and which can be applied to both statements and…

Logic · Mathematics 2024-11-11 Ivano Ciardelli

The paper explores properties of the {\L}ukasiewicz {\mu}-calculus, or {\L}{\mu} for short, an extension of {\L}ukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe…

Logic in Computer Science · Computer Science 2015-10-06 Matteo Mio , Alex Simpson

The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…

Logic in Computer Science · Computer Science 2015-09-11 Martin Lange

A landmark result in the study of logics for formal verification is Janin & Walukiewicz's theorem, stating that the modal $\mu$-calculus ($\mu\mathrm{ML}$) is equivalent modulo bisimilarity to standard monadic second-order logic (here…

Logic in Computer Science · Computer Science 2018-09-12 Facundo Carreiro , Alessandro Facchini , Yde Venema , Fabio Zanasi

The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is…

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

The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…

Logic in Computer Science · Computer Science 2013-09-05 Matteo Mio , Alex Simpson

The two-way modal mu-calculus is the extension of the (standard) one-way mu-calculus with converse (backward-looking) modalities. For this logic we introduce two new sequent-style proof calculi: a non-wellfounded system admitting infinite…

Logic in Computer Science · Computer Science 2025-08-12 Johannes Kloibhofer , Yde Venema

Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the…

Logic in Computer Science · Computer Science 2015-07-01 Helle Hvid Hansen , Clemens Kupke , Eric Pacuit

We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended…

Logic in Computer Science · Computer Science 2014-06-25 Lauri Hella , Kerkko Luosto , Katsuhiko Sano , Jonni Virtema

A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (probabilistic, cyber-physical, etc.), the focus shifted to…

Logic in Computer Science · Computer Science 2021-05-24 Yuichi Komorida , Shin-ya Katsumata , Clemens Kupke , Jurriaan Rot , Ichiro Hasuo

We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability…

Logic in Computer Science · Computer Science 2023-06-22 Bartek Klin , Mateusz Łełyk

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…

Logic in Computer Science · Computer Science 2012-02-17 Martin Lange , Etienne Lozes

A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive…

Logic in Computer Science · Computer Science 2021-09-20 Clemens Kupke , Johannes Marti , Yde Venema

We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras. In the first part of the paper we construct an endofunctor on the category of…

Logic in Computer Science · Computer Science 2023-06-22 Guram Bezhanishvili , Nick Bezhanishvili , Jim de Groot

In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…

Logic · Mathematics 2018-01-19 Tomasz Witczak

The topological $\mu$-calculus has gathered attention in recent years as a powerful framework for representation of spatial knowledge. In particular, spatial relations can be represented over finite structures in the guise of weakly…

Logic · Mathematics 2023-07-31 David Fernández-Duque , Konstantinos Papafilippou
‹ Prev 1 2 3 10 Next ›