Modal and guarded characterisation theorems over finite transition systems

DOI10.1016/j.apal.2004.04.003zbMath1056.03018OpenAlexW2043132490MaRDI QIDQ1886323

Martin Otto

Publication date: 18 November 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.04.003

zbMATH Keywords

Finite model theoryBisimulationPreservationModal logicGuarded fragmentCharacterisation theorems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Model theory of finite structures (03C13)

Related Items (9)

PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT ⋮ Unnamed Item ⋮ SOME MODEL THEORY OF GUARDED NEGATION ⋮ Expressivity of second order propositional modal logic ⋮ Unnamed Item ⋮ Guarded Negation ⋮ Modal characterisation theorems over special classes of frames ⋮ INQUISITIVE BISIMULATION ⋮ Copy and remove as dynamic operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model theory.
• Modal languages and bounded fragments of predicate logic
• Modal logic over finite structures
• A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
• Some useful preservation theorems
• Interpolation, preservation, and pebble games
• Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures
• On the Restraining Power of Guards
• Back and forth between guarded and modal logics

This page was built for publication: Modal and guarded characterisation theorems over finite transition systems