A proper hierarchy of propositional sequent calculi

DOI10.1016/0304-3975(95)00193-XzbMath0871.68161OpenAlexW2024117148MaRDI QIDQ1350509

Noriko H. Arai

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00193-x

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items

Reduction of Hilbert-type proof systems to the if-then-else equational logic ⋮ Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II ⋮ The proof complexity of analytic and clausal tableaux ⋮ Relative efficiency of propositional proof systems: Resolution vs. cut-free LK ⋮ EXPtime tableaux for ALC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The intractability of resolution
• The complexity of Gentzen systems for propositional logic
• Bounds for proof-search and speed-up in the predicate calculus
• Lower bounds to the size of constant-depth propositional proofs

This page was built for publication: A proper hierarchy of propositional sequent calculi