On the complexity of proof deskolemization-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the complexity of proof deskolemization

Published:2012-06 Issue:2 Volume:77 Page:669-686
ISSN:0022-4812
Container-title:The Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Baaz Matthias,Hetzl Stefan,Weller Daniel

Abstract

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

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference11 articles.

1. Lower bounds on Herbrand's theorem;Statman;Proceedings of the American Mathematical Society,1979

2. A compact representation of proofs

3. Eliminating definitions and Skolem functions in first-order logic

4. Cut normal forms and proof complexity

5. The liberalized ?-rule in free variable semantic tableaux

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A SIMPLIFIED PROOF OF THE EPSILON THEOREMS;The Review of Symbolic Logic;2023-07-10

2. Induction and Skolemization in saturation theorem proving;Annals of Pure and Applied Logic;2023-01

3. Effective Skolemization;Logic, Language, Information, and Computation;2023

4. Andrews Skolemization May Shorten Resolution Proofs Non-elementarily;Logical Foundations of Computer Science;2021-12-16

5. Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$;Archive for Mathematical Logic;2021-11-22

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP