Pages that link to "Item:Q2486578"
From MaRDI portal
The following pages link to Translation of resolution proofs into short first-order proofs without choice axioms (Q2486578):
Displaying 5 items.
- Andrews Skolemization may shorten resolution proofs non-elementarily (Q2151391) (← links)
- On the mechanization of the proof of Hessenberg's theorem in coherent logic (Q2471743) (← links)
- Rocket-Fast Proof Checking for SMT Solvers (Q5458346) (← links)
- Automated Deduction – CADE-19 (Q5900728) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)