On the elimination of quantifier-free cuts
From MaRDI portal
Publication:650922
DOI10.1016/J.TCS.2011.08.035zbMATH Open1241.03069DBLPjournals/tcs/Weller11OpenAlexW2053289767WikidataQ40389168 ScholiaQ40389168MaRDI QIDQ650922FDOQ650922
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.035
Recommendations
- The role of quantifier alternations in cut elimination
- Cut Elimination in ε‐Calculi
- Cut Elimination in the Presence of Axioms
- Bounds for cut elimination in intuitionistic propositional logic
- scientific article
- scientific article; zbMATH DE number 777292
- Elimination of Quantifiers on Łukasiewicz Logics
- Elementary elimination of prenex cuts in disjunction-free intuitionistic logic
- A cut-elimination proof in intuitionistic predicate logic
- Cut-elimination for quantified conditional logic
complexityfirst-order logicHerbrand's theoremcut-eliminationexponential upper boundquantifier-free cuts
Cites Work
- Untersuchungen über das logische Schliessen. I
- Title not available (Why is that?)
- The Complexity of Propositional Proofs
- A compact representation of proofs
- Describing proofs by short tautologies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds to the size of constant-depth propositional proofs
- The role of quantifier alternations in cut elimination
- Computer Science Logic
- Cut elimination and automatic proof procedures
- Depth of proofs, depth of cut-formulas and complexity of cut formulas
- Reducing redundancy in cut-elimination by resolution
- Herbrand Sequent Extraction
Cited In (4)
This page was built for publication: On the elimination of quantifier-free cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650922)
