Date of Original Version

10-10-2000

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

In any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions with a polynomial bound on the increase in proof length. In any classical first-order strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions with a polynomial bound on the increase in proof length.

Comments

CMU-PHIL-113

Included in

Philosophy Commons

Share

COinS