Proceedings Seventh International Workshop on Classical Logic and Computation

2018/10/12 by Stefano Berardi, Alexandre Miquel · 3 citations
Computer Science · #cs.LO

paper · pdf · doi:10.4204/eptcs.281

published as EPTCS 281, 2018

arxiv created 2018/10/12 · arxiv updated 2018/10/15

Abstract

This special issue cover the seventh and last conference of the CL&C series, started in 2006 in San Servolo. Topics are the computational content of logics between intuitionistic logic and classical logic, through normalization, and a new topic, cyclic proofs and the complexity of checking the correctness of a cyclic proof. Accepted papers include an empirical comparison of time consumption of different normalization algorithms, and new reductions sets for several extensions of intuitionistic logic having the Herbrand disjunction property. Another paper provides a reduction set for admissible rules for intuitionistic logic. A paper describes a subset of cyclic proofs having a polynomial-time algorithm checking correctness.

Cited by

• Admissible Tools in the Kitchen of Intuitionistic Logic
• Fast Cut-Elimination using Proof Terms: An Empirical Study
• Validating Back-links of FOLID Cyclic Pre-proofs
• On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains

Related

• Proceedings Fifth International Workshop on Classical Logic and Computation
• Proceedings Sixth International Workshop on Classical Logic and Computation
• Proceedings Fourth Workshop on Classical Logic and Computation
• Proceedings Third International Workshop on Classical Logic and Computation
• Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic