scientific article; zbMATH DE number 7362064

zbMath1464.03088arXiv1404.0082MaRDI QIDQ4994969

Edward Hermann Haeusler, Marcela Quispe-Cruz, L. N. Gordeev

Publication date: 22 June 2021

Full work available at URL: https://arxiv.org/abs/1404.0082

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Related Items (5)

Proof compression and NP versus PSPACE ⋮ On strong normalization in proof-graphs for propositional logic ⋮ Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs ⋮ The Role of Structural Reasoning in the Genesis of Graph Theory ⋮ How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning

This page was built for publication: