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

DOI10.4230/LIPICS.FSCD.2021.29MaRDI QIDQ6159945zbMATH OpenOpenAlexFDO

Authors 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

circular proofsconfluencenormalisationreverse mathematicssystem Ttype structures

Mathematics Subject Classification ID

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

Recommendations

• New Computational Paradigms
• Continuous semantics for strong normalisation
• Cyclic implicit complexity
• Strong normalization in core type theory
• Computer Science Logic

Cited in

(7)

• Cyclic proofs with ordering constraints
• Abstract cyclic proofs
• Cyclic implicit complexity
• Infinitary cut-elimination via finite approximations
• Computational expressivity of (circular) proofs with fixed points
• Logic programming with multiplicative structures
• 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)