Complexity of cubical cofibration logics. I: coNP-complete examples

DOI10.4230/LIPICS.TYPES.2024.9MaRDI QIDQ7292893zbMATH OpenFDO

Authors Robert Rose, Daniel R. Licata

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TYPES.2024.9

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Type theory (03B38) Complexity of computation (including implicit computational complexity) (03D15) Categorical logic, topoi (03G30)

Cites work

• A Constructive Model of Directed Univalence in Bicubical Sets
• Syntax and models of Cartesian cubical type theory
• Varieties of cubical sets

Cited in

(1)

• Automating boundary filling in cubical type theories

This page was built for publication: Complexity of cubical cofibration logics. I: coNP-complete examples

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