A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits

DOI10.1007/3-540-61208-4_17zbMath1412.68139OpenAlexW1576623301MaRDI QIDQ4645242

Michael Mendler

Publication date: 10 January 2019

Published in: Theorem Proving with Analytic Tableaux and Related Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61208-4_17

Mathematics Subject Classification ID

Related Items (1)

Asynchronous Logic Circuits and Sheaf Obstructions

Uses Software

• LEGO

Cites Work

• Untersuchungen über das logische Schliessen. I
• Contraction-free sequent calculi for intuitionistic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits