scientific article; zbMATH DE number 6829288

DOI10.4230/LIPICS.CCC.2015.412MaRDI QIDQ4601840zbMATH OpenFDO

Authors Fu Li, Iddo Tzameret, Zheng Yu Wang

Publication date 24 January 2018

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2015.412

zbMATH Keywords

algebraic complexityFrege proofsideal proof systemnon-commutative formulasproof complexity

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• Characterizing propositional proofs as noncommutative formulas
• Non-commutative proof construction: a constraint-based approach
• Towards a semantics of proofs for non-commutative logic: Multiplicatives and additives
• Connection-based proof construction in non-commutative logic
• Non-commutative logic. III: Focusing proofs.
• New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems
• A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
• scientific article; zbMATH DE number 786497
• Publication:4724626

Cited in

(3)

• Algebraic proofs over noncommutative formulas
• Characterizing propositional proofs as noncommutative formulas
• Witnessing matrix identities and proof complexity

This page was built for publication:

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