|
This article is cited in 22 scientific papers (total in 22 papers)
Absolute realizability of predicate formulas
V. E. Plisko
Abstract:
The concept of an absolutely realizable predicate formula is introduced. It can be regarded as a certain refinement of the concept of a constructively generally valid formula in predicate logic. It is proved that the class of all absolutely realizable formulas is a $\Pi^1_1$-complete set.
Bibliography: 16 titles.
Received: 02.04.1982
Citation:
V. E. Plisko, “Absolute realizability of predicate formulas”, Math. USSR-Izv., 22:2 (1984), 291–308
Linking options:
https://www.mathnet.ru/eng/im1393https://doi.org/10.1070/IM1984v022n02ABEH001444 https://www.mathnet.ru/eng/im/v47/i2/p315
|
Statistics & downloads: |
Abstract page: | 490 | Russian version PDF: | 215 | English version PDF: | 24 | References: | 54 | First page: | 3 |
|