Standard

Notes on the computational aspects of Kripke's theory of truth. / Speranski, Stanislav O.

в: Studia Logica, Том 105, № 2, 2017, стр. 407–429.

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

Harvard

Speranski, SO 2017, 'Notes on the computational aspects of Kripke's theory of truth', Studia Logica, Том. 105, № 2, стр. 407–429. https://doi.org/10.1007/s11225-016-9694-8

APA

Speranski, S. O. (2017). Notes on the computational aspects of Kripke's theory of truth. Studia Logica, 105(2), 407–429. https://doi.org/10.1007/s11225-016-9694-8

Vancouver

Speranski SO. Notes on the computational aspects of Kripke's theory of truth. Studia Logica. 2017;105(2):407–429. https://doi.org/10.1007/s11225-016-9694-8

Author

Speranski, Stanislav O. / Notes on the computational aspects of Kripke's theory of truth. в: Studia Logica. 2017 ; Том 105, № 2. стр. 407–429.

BibTeX

@article{c4c8c9a1862b40ab8cfdf7ac14b2aab5,
title = "Notes on the computational aspects of Kripke's theory of truth",
abstract = "The paper contains a survey on the complexity of various truth hierarchies arising in Kripke{\textquoteright}s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.",
keywords = "truth, groundedness, dependence, inductive definitions, complexity, truth, groundedness, dependence, inductive definitions, complexity",
author = "Speranski, {Stanislav O.}",
year = "2017",
doi = "10.1007/s11225-016-9694-8",
language = "English",
volume = "105",
pages = "407–429",
journal = "Studia Logica",
issn = "0039-3215",
publisher = "Springer Nature",
number = "2",

}

RIS

TY - JOUR

T1 - Notes on the computational aspects of Kripke's theory of truth

AU - Speranski, Stanislav O.

PY - 2017

Y1 - 2017

N2 - The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.

AB - The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.

KW - truth

KW - groundedness

KW - dependence

KW - inductive definitions

KW - complexity

KW - truth

KW - groundedness

KW - dependence

KW - inductive definitions

KW - complexity

U2 - 10.1007/s11225-016-9694-8

DO - 10.1007/s11225-016-9694-8

M3 - Article

VL - 105

SP - 407

EP - 429

JO - Studia Logica

JF - Studia Logica

SN - 0039-3215

IS - 2

ER -

ID: 7745219