Switch to: References

Add citations

You must login to add citations.
  1. On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
    A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions. The main result is a lower bound on proof complexity with respect to this new definition of complexity.
    Download  
     
    Export citation  
     
    Bookmark  
  • Typical forcings, NP search problems and an extension of a theorem of Riis.Moritz Müller - 2021 - Annals of Pure and Applied Logic 172 (4):102930.
    Download  
     
    Export citation  
     
    Bookmark   1 citation