The power of clockings

TL;DR

This paper explores the expressive capabilities of a Turing-complete logic grounded in game-theoretic semantics, offering new characterizations for various model classes through specific logic fragments.

Contribution

It introduces novel fragments and variants of the logic that provide natural characterizations for fundamental model classes, advancing understanding of logical expressiveness.

Findings

Identifies fragments of the logic with specific expressive powers

Provides characterizations for key families of models

Demonstrates the logic's Turing-completeness

Abstract

We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of model classes.