  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.
