Cyclic proofs for transfinite expressions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Cyclic proofs for transfinite expressions

Résumé

We introduce a cyclic proof system for proving inclusions of transfinite expressions, describing languages of words of ordinal length. We show that recognising valid cyclic proofs is decidable, that our system is sound and complete, and well-behaved with respect to cuts. Moreover, cyclic proofs can be effectively computed from expressions inclusions. We show how to use this to obtain a Pspace algorithm for transfinite expression inclusion.
Fichier principal
Vignette du fichier
CSL22long.pdf (836.42 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03669657 , version 1 (25-05-2022)

Identifiants

Citer

Emile Hazard, Denis Kuperberg. Cyclic proofs for transfinite expressions. 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), Feb 2022, Göttingen, Germany. pp.23, ⟨10.4230/LIPIcs.CSL.2022.23⟩. ⟨hal-03669657⟩
47 Consultations
30 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More