Affiliation:
1. Carnegie Mellon University, Pittsburgh, PA
Abstract
From proofs in any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions in polynomial time. From proofs in any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions in polynomial time.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A SIMPLIFIED PROOF OF THE EPSILON THEOREMS;The Review of Symbolic Logic;2023-07-10
2. Finitely axiomatized theories lack self‐comprehension;Bulletin of the London Mathematical Society;2022-07-15
3. Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$;Archive for Mathematical Logic;2021-11-22
4. A proof-theoretic approach to certifying skolemization;Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019;2019
5. Ontology-Mediated Queries;Journal of the ACM;2018-09-18