A circular proof system for the hybrid mu-calculus

01/14/2020
by   Sebastian Enqvist, et al.
0

We present a circular and cut-free proof system for the hybrid mu-calculus and prove its soundness and completeness. The system uses names for fixpoint unfoldings, like the circular proof system for the mu-calculus previously developed by Stirling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2016

Proof nets for the Displacement calculus

We present a proof net calculus for the Displacement calculus and show i...
research
12/13/2021

Proof of Steak

We introduce Proof-of-Steak (PoS) as a fundamental net-zero block genera...
research
09/06/2022

Encodability and Separation for a Reflective Higher-Order Calculus

The ρ-calculus (Reflective Higher-Order Calculus) of Meredith and Radest...
research
03/05/2020

Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems

MaxSAT is a very popular language for discrete optimization with many do...
research
02/28/2023

Computational expressivity of (circular) proofs with fixed points

We study the computational expressivity of proof systems with fixed poin...
research
01/12/2018

A Tableaux Calculus for Reducing Proof Size

A tableau calculus is proposed, based on a compressed representation of ...
research
12/03/2017

Circular genome rearrangement models: applying representation theory to evolutionary distance calculations

We investigate the symmetry of circular genome rearrangement models, dis...

Please sign up or login with your details

Forgot password? Click here to reset