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

page 1

page 2

page 3

page 4

research
09/01/2023

A new calculus for intuitionistic Strong Löb logic: strong termination and cut-elimination, formalised

We provide a new sequent calculus that enjoys syntactic cut-elimination ...
research
03/14/2019

A two-dimensional metric temporal logic

We introduce a two-dimensional metric (interval) temporal logic whose in...
research
01/23/2013

Quantifier Elimination for Statistical Problems

Recent improvement on Tarski's procedure for quantifier elimination in t...
research
04/16/2023

A general approach to asymptotic elimination of aggregation functions and generalized quantifiers

We consider a logic with truth values in the unit interval and which use...
research
09/04/2023

Multirole Logic and Multiparty Channels

We identify multirole logic as a new form of logic in which conjunction/...
research
05/04/2021

A Subatomic Proof System for Decision Trees

We design a proof system for propositional classical logic that integrat...
research
09/12/2018

A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic

In this paper we introduce a term calculus B which adds to the affine λ...

Please sign up or login with your details

Forgot password? Click here to reset