Sign Up to like & get
recommendations!
1
Published in 2022 at "Mathematical Structures in Computer Science"
DOI: 10.1017/s0960129522000366
Abstract: Abstract One of the most fundamental properties of a proof system is analyticity, expressing the fact that a proof of a given formula F only uses subformulas of F. In sequent calculus, this property is…
read more here.
Keywords:
linear logic;
cut admissibility;
mathsf;
framework ... See more keywords