The Modal Logic of Pure Provability
نویسنده
چکیده
We introduce a propositional modal logic PP of “pure” provability in arbitrary theories (propositional or first-order) where the 2 operator means “provable in all extensions”. This modal logic has been considered in another guise by Kripke. An axiomatization and a decision procedure are given and the 23 subtheory is characterized.
منابع مشابه
Modal Provability Foundations for Negation by Failure
This paper is a contribution to the foundation of negation by failure. It presents a view of negation by failure as a modal provability notion. Negation by failure is a central notion in Logic Programming and is used extensively in practice. There are various attempts at its foundations each with its own difficulties and limitations. We would like to present the modal point of view which, as fa...
متن کاملOn modal logic of deductive closure
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be decidable and complete with respect to this semantics.
متن کامل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.
متن کاملKripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic [9, 5, 8]. This system plays an important role in some recent applications of provability algebras in proof theory [2, 3]. However, an obstacle in the study of GLP is that it is incomplete w.r.t. any class ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 31 شماره
صفحات -
تاریخ انتشار 1990