Pages that link to "Item:Q2892685"
From MaRDI portal
The following pages link to On the complexity of proof deskolemization (Q2892685):
Displaying 8 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Induction and Skolemization in saturation theorem proving (Q2084957) (← links)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
- Andrews Skolemization may shorten resolution proofs non-elementarily (Q2151391) (← links)
- Cut-elimination: syntax and semantics (Q2259012) (← links)
- (Q3384900) (← links)
- UNSOUND INFERENCES MAKE PROOFS SHORTER (Q4628675) (← links)
