Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
    Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Proof, Computation and Agency: Logic at the Crossroads.Johan van Benthem, Amitabha Gupta & Rohit Parikh (eds.) - 2011 - Dordrecht, Netherland: Springer.
    Proof, Computation and Agency: Logic at the Crossroads provides an overview of modern logic and its relationship with other disciplines. As a highlight, several articles pursue an inspiring paradigm called 'social software', which studies patterns of social interaction using techniques from logic and computer science. The book also demonstrates how logic can join forces with game theory and social choice theory. A second main line is the logic-language-cognition connection, where the articles collected here bring several fresh perspectives. Finally, the book (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation