On Provability Logic

نویسنده

  • Vı́tězslav Švejdar
چکیده

This is an introductory paper about provability logic, a modal propositional logic in which necessity is interpreted as formal provability. We discuss the ideas that led to establishing this logic, we survey its history and the most important results, and we emphasize its applications in metamathematics. Stress is put on the use of Gentzen calculus for provability logic. We sketch our version of a decision procedure for provability logic and mention some connections to computational complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Project Report Logic Programming in Constructive Provability Logic 15-816 Modal Logic

We present a novel formulation of CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We use this logic as a basis for a discussion of negation in logic programming.

متن کامل

On the Provability Logic of Bounded Arithmetic

Berarducci, A. and R. Verbrugge, On the provability logic of bounded arithmetic, Annals of Pure and Applied Logic 61 (1993) 75-93. Let PLQ be the provability logic of IA, + G?,. We prove some containments of the form L c_ PLQc Th(V) where L is the provability logic of PA and V is a suitable class of Kripke frames.

متن کامل

On Two Models of Provability

Gödel’s modal logic approach to analyzing provability attracted a great deal of attention and eventually led to two distinct mathematical models. The first is the modal logic GL, also known as the Provability Logic, which was shown in 1979 by Solovay to be the logic of the formal provability predicate. The second is Gödel’s original modal logic of provability S4, together with its explicit coun...

متن کامل

Constructive Provability Logic 1

We present two variants of an intuitionistic sequent calculus that validates the Löb rule and permits logical reflection over provability. We explore properties of both variants of this logic, which we call constructive provability logic due to its close ties to Gödel-Löb provability logic.

متن کامل

Franco Montagna's Work on Provability Logic and Many-valued Logic

Franco Montagna, a prominent logician and one of the leaders of the Italian school on Mathematical Logic, passed away on February 18, 2015. We survey some of his results and ideas in the two disciplines he greatly contributed along his career: provability logic and many-valued logic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000