On the complexity of proof deskolemization

Name: Work Video:
Duration: 3 min 30 s
Description: 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.
Matthias Baaz; Stefan Hetzl; Daniel S. Weller
{'id': 'https://openalex.org/W2129156376', 'doi': 'https://doi.org/10.2178/jsl/1333566645', 'title': 'On the complexity of proof deskolemization', 'display_name': 'On the complexity of proof deskolemization', 'publication_year': 2012, 'publication_date': '2012-04-04', 'ids': {'openalex': 'https://openalex.org/W2129156376', 'doi': 'https://doi.org/10.2178/jsl/1333566645', 'mag': '2129156376'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.2178/jsl/1333566645', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S177675236', 'display_name': 'Journal of Symbolic Logic', 'issn_l': '0022-4812', 'issn': ['0022-4812', '1943-5886'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310311721', 'host_organization_name': 'Cambridge University Press', 'host_organization_lineage': ['https://openalex.org/P4310311721', 'https://openalex.org/P4310311702'], 'host_organization_lineage_names': ['Cambridge University Press', 'University of Cambridge'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5035315045', 'display_name': 'Matthias Baaz', 'orcid': 'https://orcid.org/0000-0002-7815-2501'}, 'institutions': [{'id': 'https://openalex.org/I145847075', 'display_name': 'TU Wien', 'ror': 'https://ror.org/04d836q62', 'country_code': 'AT', 'type': 'education', 'lineage': ['https://openalex.org/I145847075']}], 'countries': ['AT'], 'is_corresponding': False, 'raw_author_name': 'Matthias Baaz', 'raw_affiliation_strings': ['Institute of Discrete Mathematics and Geometry (E104), Vienna University of Technology, Wiedner Hauptstraße 8-10, 1040 Vienna, Austria, E-mail: [email protected]'], 'affiliations': [{'raw_affiliation_string': 'Institute of Discrete Mathematics and Geometry (E104), Vienna University of Technology, Wiedner Hauptstraße 8-10, 1040 Vienna, Austria, E-mail: [email protected]', 'institution_ids': ['https://openalex.org/I145847075']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5058192101', 'display_name': 'Stefan Hetzl', 'orcid': 'https://orcid.org/0000-0002-6461-5982'}, 'institutions': [{'id': 'https://openalex.org/I204730241', 'display_name': 'Université Paris Cité', 'ror': 'https://ror.org/05f82e368', 'country_code': 'FR', 'type': 'education', 'lineage': ['https://openalex.org/I204730241']}, {'id': 'https://openalex.org/I169173203', 'display_name': 'Délégation Paris 7', 'ror': 'https://ror.org/00bw5n526', 'country_code': 'FR', 'type': 'government', 'lineage': ['https://openalex.org/I154526488', 'https://openalex.org/I169173203']}], 'countries': ['FR'], 'is_corresponding': False, 'raw_author_name': 'Stefan Hetzl', 'raw_affiliation_strings': ['Laboratoire Preuves, Programmes et Systèmes (PPS), Université Paris Diderot – Paris 7, 175 Rue du Chevaleret, 75013 Paris, France, E-mail: [email protected]'], 'affiliations': [{'raw_affiliation_string': 'Laboratoire Preuves, Programmes et Systèmes (PPS), Université Paris Diderot – Paris 7, 175 Rue du Chevaleret, 75013 Paris, France, E-mail: [email protected]', 'institution_ids': ['https://openalex.org/I204730241', 'https://openalex.org/I169173203']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5006764308', 'display_name': 'Daniel S. Weller', 'orcid': 'https://orcid.org/0000-0001-9818-7325'}, 'institutions': [{'id': 'https://openalex.org/I145847075', 'display_name': 'TU Wien', 'ror': 'https://ror.org/04d836q62', 'country_code': 'AT', 'type': 'education', 'lineage': ['https://openalex.org/I145847075']}], 'countries': ['AT'], 'is_corresponding': False, 'raw_author_name': 'Daniel Weller', 'raw_affiliation_strings': ['Institute of Computer Languages (E185), Vienna University of Technology, Favoritenstraβe 9, 1040 Vienna, Austria, E-mail: [email protected]'], 'affiliations': [{'raw_affiliation_string': 'Institute of Computer Languages (E185), Vienna University of Technology, Favoritenstraβe 9, 1040 Vienna, Austria, E-mail: [email protected]', 'institution_ids': ['https://openalex.org/I145847075']}]}], 'institution_assertions': [], 'countries_distinct_count': 2, 'institutions_distinct_count': 3, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 2.888, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 27, 'citation_normalized_percentile': {'value': 0.999968, 'is_in_top_1_percent': True, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 91, 'max': 92}, 'biblio': {'volume': '77', 'issue': '2', 'first_page': '669', 'last_page': '686'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10126', 'display_name': 'Logic, programming, and type systems', 'score': 0.9996, 'subfield': {'id': 'https://openalex.org/subfields/1702', 'display_name': 'Artificial Intelligence'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, 'topics': [{'id': 'https://openalex.org/T10126', 'display_name': 'Logic, programming, and type systems', 'score': 0.9996, 'subfield': {'id': 'https://openalex.org/subfields/1702', 'display_name': 'Artificial Intelligence'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T11567', 'display_name': 'semigroups and automata theory', 'score': 0.9988, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T12002', 'display_name': 'Computability, Logic, AI Algorithms', 'score': 0.998, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/proof-complexity', 'display_name': 'Proof complexity', 'score': 0.72863257}, {'id': 'https://openalex.org/keywords/combinatorial-proof', 'display_name': 'Combinatorial proof', 'score': 0.44436815}], 'concepts': [{'id': 'https://openalex.org/C108710211', 'wikidata': 'https://www.wikidata.org/wiki/Q11538', 'display_name': 'Mathematical proof', 'level': 2, 'score': 0.9137144}, {'id': 'https://openalex.org/C105605280', 'wikidata': 'https://www.wikidata.org/wiki/Q7249999', 'display_name': 'Proof complexity', 'level': 3, 'score': 0.72863257}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.6811885}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.4985721}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.48574358}, {'id': 'https://openalex.org/C151376022', 'wikidata': 'https://www.wikidata.org/wiki/Q168698', 'display_name': 'Exponential function', 'level': 2, 'score': 0.46397075}, {'id': 'https://openalex.org/C118539577', 'wikidata': 'https://www.wikidata.org/wiki/Q3402784', 'display_name': 'Combinatorial proof', 'level': 2, 'score': 0.44436815}, {'id': 'https://openalex.org/C77553402', 'wikidata': 'https://www.wikidata.org/wiki/Q13222579', 'display_name': 'Upper and lower bounds', 'level': 2, 'score': 0.4239955}, {'id': 'https://openalex.org/C2318724', 'wikidata': 'https://www.wikidata.org/wiki/Q852732', 'display_name': 'Proof theory', 'level': 3, 'score': 0.41055572}, {'id': 'https://openalex.org/C2777686260', 'wikidata': 'https://www.wikidata.org/wiki/Q144037', 'display_name': 'Calculus (dental)', 'level': 2, 'score': 0.32583472}, {'id': 'https://openalex.org/C134306372', 'wikidata': 'https://www.wikidata.org/wiki/Q7754', 'display_name': 'Mathematical analysis', 'level': 1, 'score': 0.046780527}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.04416582}, {'id': 'https://openalex.org/C71924100', 'wikidata': 'https://www.wikidata.org/wiki/Q11190', 'display_name': 'Medicine', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C199343813', 'wikidata': 'https://www.wikidata.org/wiki/Q12128', 'display_name': 'Dentistry', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.2178/jsl/1333566645', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S177675236', 'display_name': 'Journal of Symbolic Logic', 'issn_l': '0022-4812', 'issn': ['0022-4812', '1943-5886'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310311721', 'host_organization_name': 'Cambridge University Press', 'host_organization_lineage': ['https://openalex.org/P4310311721', 'https://openalex.org/P4310311702'], 'host_organization_lineage_names': ['Cambridge University Press', 'University of Cambridge'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [{'display_name': 'Reduced inequalities', 'score': 0.44, 'id': 'https://metadata.un.org/sdg/10'}], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 14, 'referenced_works': ['https://openalex.org/W1570226938', 'https://openalex.org/W1795577507', 'https://openalex.org/W1975810242', 'https://openalex.org/W1993434661', 'https://openalex.org/W2033019111', 'https://openalex.org/W2039977878', 'https://openalex.org/W2077585224', 'https://openalex.org/W2084443499', 'https://openalex.org/W2085522128', 'https://openalex.org/W2152535604', 'https://openalex.org/W4238292764', 'https://openalex.org/W4249736722', 'https://openalex.org/W4255132490', 'https://openalex.org/W560364776'], 'related_works': ['https://openalex.org/W4297691964', 'https://openalex.org/W4200235154', 'https://openalex.org/W3173957725', 'https://openalex.org/W3157478331', 'https://openalex.org/W3153156984', 'https://openalex.org/W3140175842', 'https://openalex.org/W2461509449', 'https://openalex.org/W2106155109', 'https://openalex.org/W1610564136', 'https://openalex.org/W104007018'], 'abstract_inverted_index': {'Abstract': [0], 'We': [1], 'consider': [2], 'the': [3, 10, 19, 22, 29], 'following': [4], 'problem:': [5], 'Given': [6], 'a': [7, 13], 'proof': [8, 24], 'of': [9, 12, 21, 25, 31], 'Skolemization': [11], 'formula': [14], 'F': [15, 26], ',': [16], 'what': [17], 'is': [18], 'length': [20], 'shortest': [23], '?': [27], 'For': [28], 'restriction': [30], 'this': [32], 'question': [33], 'to': [34], 'cut-free': [35], 'proofs': [36], 'we': [37], 'prove': [38], 'corresponding': [39], 'exponential': [40], 'upper': [41], 'and': [42], 'lower': [43], 'bounds.': [44]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2129156376', 'counts_by_year': [{'year': 2024, 'cited_by_count': 1}, {'year': 2023, 'cited_by_count': 2}, {'year': 2022, 'cited_by_count': 1}, {'year': 2021, 'cited_by_count': 2}, {'year': 2020, 'cited_by_count': 1}, {'year': 2019, 'cited_by_count': 5}, {'year': 2018, 'cited_by_count': 3}, {'year': 2017, 'cited_by_count': 1}, {'year': 2016, 'cited_by_count': 2}, {'year': 2015, 'cited_by_count': 1}, {'year': 2014, 'cited_by_count': 5}, {'year': 2013, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 2}], 'updated_date': '2024-12-14T17:32:41.122025', 'created_date': '2016-06-24'}
Publication Information

Basic Information

Access and Citation

AI Researcher Chatbot

Primary Location

Authors

Topics

Keywords

Related Works
