|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
The logic of the Gödel proof predicateстатья
- Авторы: Artëmov Sergei, Straßen Tyko
- Сборник: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings
- Серия: Lecture Notes in Computer Science
- Том: 713
- Год издания: 1993
- Место издания: Springer
- Первая страница: 71
- Последняя страница: 82
- DOI: 10.1007/BFb0022556
- Аннотация: We discuss the logics of the operators “p is a proof of A” and “p is a proof containing A” for the standard Gödel proof predicate in Peano Arithmetic. Decidability and arithmetical completeness of these logics are proved. We use the same semantics as for the Provability Logic where the operator “A is provable” is studied.
- Добавил в систему: Золин Евгений Евгеньевич