Skip to main content Accessibility help
×
Home
Hostname: page-component-99c86f546-md8df Total loading time: 0.345 Render date: 2021-12-07T01:34:11.746Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

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.

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.)

References

[1] Avigad, Jeremy, Eliminating definitions and Skolem functions in first-order logic, ACM Transactions on Computational Logic, vol. 4 (2003), no. 3, pp. 402415.CrossRefGoogle Scholar
[2] Baaz, Matthias and Leitsch, Alexander, Skolemization and proof complexity, Fundamenta Informaticae, vol. 20 (1994), no. 4, pp. 353379.Google Scholar
[3] Baaz, Matthias and Leitsch, Alexander, Cut normalforms and proof complexity, Annals of Pure and Applied Logic, vol. 97 (1999), pp. 127177.CrossRefGoogle Scholar
[4] Baaz, Matthias and Leitsch, Alexander, Cut-elimination and redundancy-elimination by resolution, Journal of Symbolic Computation, vol. 29 (2000), no. 2, pp. 149176.CrossRefGoogle Scholar
[5] Clote, Peter and Krajíček, Jan, Open problems, Arithmetic, proof theory and computational complexity (Clote, Peter and Krajíček, Jan, editors), Oxford University Press, 1993, pp. 119.Google Scholar
[6] Gentzen, Gerhard, Untersuchungen über das logische Schlieβen II, Mathematische Zeitschrift, vol. 39 (1935), no. 1, pp. 405431.CrossRefGoogle Scholar
[7] Hähnle, Reiner and Schmitt, Peter H., The liberalized δ-rule in free variable semantic tableaux, Journal of Automated Reasoning, vol. 13 (1994), no. 2, pp. 211221.CrossRefGoogle Scholar
[8] Hilbert, David and Bernays, Paul, Grundlagen der Mathematik II, 2nd ed., Springer, 1970.CrossRefGoogle Scholar
[9] Miller, Dale, A compact representation of proofs, Studia Logica, vol. 46 (1987), no. 4, pp. 347370.CrossRefGoogle Scholar
[10] Statman, Richard, Lower bounds on Herbrand's theorem, Proceedings of the American Mathematical Society, vol. 75 (1979), pp. 104107.Google Scholar
[11] Troelstra, A. S. and Schwichtenberg, H., Basic proof theory, second ed., Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2000.CrossRefGoogle Scholar
9
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On the complexity of proof deskolemization
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

On the complexity of proof deskolemization
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

On the complexity of proof deskolemization
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *