Switch to: References

Add citations

You must login to add citations.
  1. Essential Structure of Proofs as a Measure of Complexity.Jaime Ramos, João Rasga & Cristina Sernadas - 2020 - Logica Universalis 14 (2):209-242.
    The essential structure of proofs is proposed as the basis for a measure of complexity of formulas in FOL. The motivating idea was the recognition that distinct theorems can have the same derivation modulo some non essential details. Hence the difficulty in proving them is identical and so their complexity should be the same. We propose a notion of complexity of formulas capturing this property. With this purpose, we introduce the notions of schema calculus, schema derivation and description complexity of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.
  • Admissibility in Positive Logics.Alex Citkin - 2017 - Logica Universalis 11 (4):421-437.
    The paper studies admissibility of multiple-conclusion rules in positive logics. Using modification of a method employed by M. Wajsberg in the proof of the separation theorem, it is shown that the problem of admissibility of multiple-conclusion rules in the positive logics is equivalent to the problem of admissibility in intermediate logics defined by positive additional axioms. Moreover, a multiple-conclusion rule \ follows from a set of multiple-conclusion rules \ over a positive logic \ if and only if \ follows from (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark