Date of Original Version
2003
Type
Article
Published In
ACM Transactions on Computational Logic 4 (3), July 2003: 402 - 415.
Abstract or Table of Contents
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.