Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss

DOI10.1080/11663081.2018.1525208zbMath1436.03299OpenAlexW2896871387MaRDI QIDQ4646655

Daniil Kozhemiachenko

Publication date: 14 January 2019

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2018.1525208

zbMATH Keywords

Frege systemshypersequent calculusfinite-valued Łukasiewicz logicdisjunction elimination ruleproof simulation

Mathematics Subject Classification ID

Many-valued logic (03B50) Complexity of proofs (03F20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for intuitionistic logic
• On lengths of proofs in non-classical logics
• Proof theory. 2nd ed
• An axiomatization of the finite-valued Łukasiewicz calculus
• Handbook of proof theory
• Metamathematics of fuzzy logic
• Untersuchungen über das logische Schliessen. I
• Untersuchungen über das logische Schliessen. II
• A Brief History of Natural Deduction
• The deduction rule and linear and near-linear proof simulations
• Polynomial size proofs of the propositional pigeonhole principle
• Natural 3-valued logics—characterization and proof theory
• The relative efficiency of propositional proof systems
• The Serial Transitive Closure Problem for Trees
• Simulation of Natural Deduction and Gentzen Sequent Calculus
• Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis