scientific article; zbMATH DE number 7104937
From MaRDI portal
Publication:5232911
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Publication date: 13 September 2019
Full work available at URL: https://arxiv.org/abs/1705.01823
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40)
Related Items (2)
On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation quantifiers and uniform interpolation for guarded first order logic
- Modal languages and bounded fragments of predicate logic
- A restricted second order logic for finite structures
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Pushdown processes: Games and model-checking
- Rewriting Guarded Negation Queries
- Decidability Results for the Boundedness Problem
- Deciding definability in FO2(<h,<v) on trees
- Characterization of Logics over Ranked Tree Languages
- Automata for the modal μ-calculus and related results
- Equivalences Among Relational Expressions with the Union and Difference Operators
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- Semantically Acyclic Conjunctive Queries under Functional Dependencies
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- The Freedoms of (Guarded) Bisimulation
- Effective Interpolation and Preservation in Guarded Logics
- Querying the Guarded Fragment
- Datalog LITE
- Back and forth between guarded and modal logics
- Rudiments of \(\mu\)-calculus
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication:
