Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T09:58:20.295Z Has data issue: false hasContentIssue false

On the complexity of proof deskolemization

Published online by Cambridge University Press:  12 March 2014

Matthias Baaz
Affiliation:
Institute of Discrete Mathematics and Geometry (E104), Vienna University of Technology, Wiedner Hauptstraße 8-10, 1040 Vienna, Austria, E-mail: baaz@logic.at
Stefan Hetzl
Affiliation:
Laboratoire Preuves, Programmes et Systèmes (PPS), Université Paris Diderot – Paris 7, 175 Rue du Chevaleret, 75013 Paris, France, E-mail: stefan.hetzl@pps.jussieu.fr
Daniel Weller
Affiliation:
Institute of Computer Languages (E185), Vienna University of Technology, Favoritenstraβe 9, 1040 Vienna, Austria, E-mail: weller@logic.at

Abstract

We consider the following problem: Given a proof of the Skolemization of a formula F, what is the length of the shortest proof of F? For the restriction of this question to cut-free proofs we prove corresponding exponential upper and lower bounds.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable