Switch to: References

Add citations

You must login to add citations.
  1. Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
    -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations