|
Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2003, Volume 242, Pages 123–135
(Mi tm410)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On Prenex Fragment of Provability Logic with Quantifiers on Proofs
R. È. Yavorskii Steklov Mathematical Institute, Russian Academy of Sciences
Abstract:
We consider a fragment of provability logic with quantifiers on proofs that consists of formulas with no occurrences of quantifiers in the scope of the proof predicate. By definition, a logic ql is the set of formulas that are true in the standard model of arithmetic under every interpretation based on the standard Gödel proof predicate. We describe Kripke-style semantics for the logic ql and prove the corresponding completeness theorem. For the case of injective arithmetical interpretations, the decidability is proved.
Received in October 2002
Citation:
R. È. Yavorskii, “On Prenex Fragment of Provability Logic with Quantifiers on Proofs”, Mathematical logic and algebra, Collected papers. Dedicated to the 100th birthday of academician Petr Sergeevich Novikov, Trudy Mat. Inst. Steklova, 242, Nauka, MAIK «Nauka/Inteperiodika», M., 2003, 123–135; Proc. Steklov Inst. Math., 242 (2003), 112–124
Linking options:
https://www.mathnet.ru/eng/tm410 https://www.mathnet.ru/eng/tm/v242/p123
|
Statistics & downloads: |
Abstract page: | 440 | Full-text PDF : | 147 | References: | 75 |
|