On Skolemization and Proof Complexity

Baaz, M., & Leitsch, A. (1994). On Skolemization and Proof Complexity. Fundamenta Informaticae, 20(4), 353-379.

Type

Journal article

Intellectual base

Primary research

Year

1994

DOI

10.3233/fi-1994-2044

Link

https://doi.org/10.3233/FI-1994-2044

Cited by

1 citation across 1 artifact.

Domain-specific

• Skolem Normal Form
  • Baaz and Leitsch show that prefix Skolemization can have dramatically worse Herbrand complexity than structural Skolemization, justifying attention to quantifier scope before introducing functions.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:79f78c0eca46 · see in the full table