Efficient elimination of Skolem functions in first-order logic without equality

09/04/2019
by   Ján Komara, et al.
0

We prove that elimination of a single Skolem function in pure logic increases the length of cut-free proofs only linearly. The result is shown for a variant of sequent calculus with Henkin constants instead of free variables.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset