Reduction of Hilbert-type proof systems to the if-then-else equational logic

DOI10.1007/BF02936099zbMATH Open1043.03044MaRDI QIDQ1428985FDOQ1428985

Authors: Joohee Jeong 

Publication date: 29 March 2004

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Recommendations

• On the relative efficiency of different systems for classical and nonclassical propositional logics
• Comparison of several proof systems of intuitionistic propositional logic
• A natural proof system for Herbrand's theorem
• Hilbert's program relativized; Proof-theoretical and foundational reductions
• scientific article; zbMATH DE number 65760

zbMATH Keywords

equational logicHilbert-type proof systemrelative efficiency of proof systems

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cites Work

• Discriminator varieties and symbolic computation
• The relative efficiency of propositional proof systems
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• The complexity of Gentzen systems for propositional logic
• Varieties of ”If-Then-Else“
• Equational Bases for If–Then–Else
• Title not available (Why is that?)
• A proper hierarchy of propositional sequent calculi
• Relative efficiency of propositional proof systems: Resolution vs. cut-free LK

This page was built for publication: Reduction of Hilbert-type proof systems to the if-then-else equational logic

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