|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
Two semantics and logics based on the Gödel interpretationстатья
- Автор: Plisko V.
- Сборник: Computational Logic and Proof Theory, 5th Kurt Godel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings
- Серия: Lecture Notes in Computer Science
- Том: 1289
- Год издания: 1997
- Место издания: Springer
- Первая страница: 233
- Последняя страница: 240
- DOI: 10.1007/3-540-63385-5_46
- Аннотация: Two arithmetic constructive theories based on Dialectica interpretation are introduced and studied in the paper. For an arithmetic formula A let AD be its Dialectica interpretation in the language of arithmetic in all finite types. The translation (AD)° of AD back into the language of first-order arithmetic using the system HRO of hereditary recursive operations is considered. The theories T1 and T2 consist of arithmetic sentences A such that (AD)° is true in the standard model and provable in the intuitionistic arithmetic respectively. Using the author's recent results on the arithmetic complexity of the predicate logics of constructive arithmetic theories it is proved that the logic of T1 is not recursively enumerable and the logic of T2 is Π2-complete.
- Добавил в систему: Золин Евгений Евгеньевич