Effective Skolemization

DOI10.1007/978-3-031-39784-4_5OpenAlexW4386230158MaRDI QIDQ6118680

Anela Lolic, Matthias Baaz

Publication date: 28 February 2024

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-39784-4_5

zbMATH Keywords

resolution proofsSkolemizationcut-free proofs

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Methods of cut-elimination
• Cut normal forms and proof complexity
• Andrews Skolemization may shorten resolution proofs non-elementarily
• On the complexity of proof deskolemization
• Theorem Proving via General Matings
• Lower Bounds on Herbrand's Theorem
• UNSOUND INFERENCES MAKE PROOFS SHORTER
• Resolution in type theory

This page was built for publication: Effective Skolemization