Standard

Refined hierarchy of formulas. / Selivanov, V. L.

в: Algebra and Logic, Том 30, № 5, 01.09.1991, стр. 368-378.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Selivanov, VL 1991, 'Refined hierarchy of formulas', Algebra and Logic, Том. 30, № 5, стр. 368-378. https://doi.org/10.1007/BF01980251

APA

Selivanov, V. L. (1991). Refined hierarchy of formulas. Algebra and Logic, 30(5), 368-378. https://doi.org/10.1007/BF01980251

Vancouver

Selivanov VL. Refined hierarchy of formulas. Algebra and Logic. 1991 Сент. 1;30(5):368-378. https://doi.org/10.1007/BF01980251

Author

Selivanov, V. L. / Refined hierarchy of formulas. в: Algebra and Logic. 1991 ; Том 30, № 5. стр. 368-378.

BibTeX

@article{b1cec6831ffd41f59d6afac0657ceb28,
title = "Refined hierarchy of formulas",
abstract = "In this paper a hierarchy of predicate logic which refines the hierarchy by the number of quantor alterations is introduced and studied. Theorem 1 shows that the hierarchy constructed is the most refined in a certain sense. Theorem 2 describes hierarchy classes in terms of properties of the corresponding models. In Theorems 3 and 4, the connection between the hierarchy of formulas and the hierarchy of sets presented in [1] and the index sets is studied. {\textcopyright} 1992 Plenum Publishing Corporation.",
author = "Selivanov, {V. L.}",
year = "1991",
month = sep,
day = "1",
doi = "10.1007/BF01980251",
language = "English",
volume = "30",
pages = "368--378",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer Nature",
number = "5",

}

RIS

TY - JOUR

T1 - Refined hierarchy of formulas

AU - Selivanov, V. L.

PY - 1991/9/1

Y1 - 1991/9/1

N2 - In this paper a hierarchy of predicate logic which refines the hierarchy by the number of quantor alterations is introduced and studied. Theorem 1 shows that the hierarchy constructed is the most refined in a certain sense. Theorem 2 describes hierarchy classes in terms of properties of the corresponding models. In Theorems 3 and 4, the connection between the hierarchy of formulas and the hierarchy of sets presented in [1] and the index sets is studied. © 1992 Plenum Publishing Corporation.

AB - In this paper a hierarchy of predicate logic which refines the hierarchy by the number of quantor alterations is introduced and studied. Theorem 1 shows that the hierarchy constructed is the most refined in a certain sense. Theorem 2 describes hierarchy classes in terms of properties of the corresponding models. In Theorems 3 and 4, the connection between the hierarchy of formulas and the hierarchy of sets presented in [1] and the index sets is studied. © 1992 Plenum Publishing Corporation.

UR - http://www.scopus.com/inward/record.url?scp=0346466644&partnerID=8YFLogxK

U2 - 10.1007/BF01980251

DO - 10.1007/BF01980251

M3 - Article

AN - SCOPUS:0346466644

VL - 30

SP - 368

EP - 378

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

IS - 5

ER -

ID: 127142261