Switch to: Citations

References in:

Cut-Elimination: Syntax and Semantics

Studia Logica 102 (6):1217-1244 (2014)

Add references

You must login to add references.
  1. The Number of Proof Lines and the Size of Proofs in First Order Logic.Jan Krajíček & Pavel Pudlák - 1988 - Archive for Mathematical Logic 27 (1):69-84.
  • On the Complexity of Proof Deskolemization.Matthias Baaz, Stefan Hetzl & Daniel Weller - 2012 - Journal of Symbolic Logic 77 (2):669-686.
    We consider the following problem: Given a proof of the Skolemization of a formula F, what is the length of the shortest proof of F? For the restriction of this question to cut-free proofs we prove corresponding exponential upper and lower bounds.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations