Provability in predicate product logic
نویسندگان
چکیده
We sharpen Hájek’s Completeness Theorem for theories extending predicate product logic, Π∀. By relating provability in this system to embedding properties of ordered abelian groups we construct a universal BL-chain L in the sense that a sentence is provable from Π∀ if and only if it is an L-tautology. As well we characterize the class of lexicographic sums that have this universality property.
منابع مشابه
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...
متن کاملOn Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs
Kripke-style semantics is suggested for the provability logic with quantifiers on proofs corresponding to the standard Gödel proof predicate. It is proved that the set of valid formulas is decidable. The arithmetical completeness is still an open issue.
متن کاملVardanyan’s theorem for extensions of IΣ1
Vardanyan’s theorem states that the set of PA-valid formulas of quantified modal logic is Π2-complete. This result also holds for extensions of IΣ1 on the condition that inconsistency is not provable. key words: Predicate Provability Logic
متن کاملAn overview of Interpretability Logic
A miracle happens In one hand we have a class of marvelously complex theories in predicate logic theories with su cient coding potential like PA Peano Arithmetic or ZF Zermelo Fraenkel Set Theory In the other we have certain modal propositional theories of striking simplicity We translate the modal operators of the modal theories to certain speci c xed de ned predicates of the predicate logical...
متن کاملGödelizing the Yablo Sequence
We investigate what happens when ‘truth’ is replaced with ‘provability’ in Yablo’s paradox. By diagonalization, appropriate sequences of sentences can be constructed. Such sequences contain no sentence decided by the background consistent and sufficiently strong arithmetical theory. If the provability predicate satisfies the derivability conditions, each such sentence is provably equivalent to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 46 شماره
صفحات -
تاریخ انتشار 2007