Game semantics for the constructive μ-calculus

08/31/2023
by   Leonardo Pacheco, et al.
0

We define game semantics for the constructive μ-calculus and prove its correctness. We use these game semantics to prove that the μ-calculus collapses to modal logic over 𝖢𝖲5 frames. Finally, we prove the completeness of μ 𝖢𝖲5 over 𝖢𝖲5 frames.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2020

Constructive Game Logic

Game Logic is an excellent setting to study proofs-about-programs via th...
research
06/08/2020

Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version)

We study various formulations of the completeness of first-order logic p...
research
12/31/2018

A modal aleatoric calculus for probabilistic reasoning: extended version

We consider multi-agent systems where agents actions and beliefs are det...
research
12/16/2019

On the Unity of Logic: a Sequential, Unpolarized Approach

The present work aims to give a unity of logic via standard sequential, ...
research
07/12/2017

Revisiting Elementary Denotational Semantics

Operational semantics have been enormously successful, in large part due...
research
04/21/2023

From Tractatus to Later Writings and Back – New Implications from the Nachlass

As a celebration of the Tractatus 100th anniversary it might be worth re...
research
04/16/2019

Completeness for Game Logic

Game logic was introduced by Rohit Parikh in the 1980s as a generalisati...

Please sign up or login with your details

Forgot password? Click here to reset