On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.

DOI10.4230/LIPICS.FSCD.2021.29OpenAlexW3183395447MaRDI QIDQ6159945

Anupam Das

Publication date: 23 June 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14267/pdf/LIPIcs-FSCD-2021-29.pdf/

zbMATH Keywords

confluencereverse mathematicsnormalisationtype structurescircular proofssystem T

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Computer science (68-XX)

Related Items (3)

Cyclic proofs with ordering constraints ⋮ Abstract cyclic proofs ⋮ Cyclic implicit complexity

This page was built for publication: On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159945)