Reduction of Hilbert-type proof systems to the if-then-else equational logic
From MaRDI portal
Publication:1428985
DOI10.1007/BF02936099zbMath1043.03044MaRDI QIDQ1428985
Publication date: 29 March 2004
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Discriminator varieties and symbolic computation
- The complexity of Gentzen systems for propositional logic
- A proper hierarchy of propositional sequent calculi
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK
- Propositional proof systems, the consistency of first order theories and the complexity of computations
- Varieties of ”If-Then-Else“
- Equational Bases for If–Then–Else
- On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
- The relative efficiency of propositional proof systems