On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs.

Autor:	Yavorskiy, Rostislav
Předmět:	MATHEMATICAL models SEMANTICS PROOF theory MATHEMATICAL logic MATHEMATICAL formulas DECIDABILITY (Mathematical logic)
Zdroj:	Journal of Logic & Computation; Aug2005, Vol. 15 Issue 4, p539-549, 11p
Abstrakt:	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. [ABSTRACT FROM PUBLISHER]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu