Proof-graphs: a thorough cycle treatment, normalization and subformula property

DOI10.3233/FI-2011-380MaRDI QIDQ3100159zbMATH OpenOpenAlexFDO

Authors Gleifer V. Alves, Anjolina de Oliveira, Ruy J. G. B. de Queiroz

Publication date 22 November 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2011-380

zbMATH Keywords

proof theorycyclesnormalizationclassical natural deduction proof systemmultiple-conclusion proof structureproof-graphs

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Recommendations

• Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization
• Normalization of N-graphs via sub-N-graphs
• Normal derivability in classical natural deduction
• Removing cycles from proofs
• On strong normalization in proof-graphs for propositional logic

Cited in

(4)

• On strong normalization in proof-graphs for propositional logic
• Normalization of N-graphs via sub-N-graphs
• Removing cycles from proofs
• Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization

This page was built for publication: Proof-graphs: a thorough cycle treatment, normalization and subformula property

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