Standard

Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability. / Odintsov, Sergei P.; Speranski, Stanislav O.; Shevchenko, Igor Yu.

In: Studia Logica, Vol. 106, No. 3, 01.06.2018, p. 637-670.

Research output: Contribution to journal › Article › peer-review

Harvard

Odintsov, SP, Speranski, SO & Shevchenko, IY 2018, 'Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability', Studia Logica, vol. 106, no. 3, pp. 637-670. https://doi.org/10.1007/s11225-017-9760-x

APA

Odintsov, S. P., Speranski, S. O., & Shevchenko, I. Y. (2018). Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability. Studia Logica, 106(3), 637-670. https://doi.org/10.1007/s11225-017-9760-x

Vancouver

Odintsov SP, Speranski SO, Shevchenko IY. Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability. Studia Logica. 2018 Jun 1;106(3):637-670. doi: 10.1007/s11225-017-9760-x

Author

Odintsov, Sergei P. ; Speranski, Stanislav O. ; Shevchenko, Igor Yu. / Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability. In: Studia Logica. 2018 ; Vol. 106, No. 3. pp. 637-670.

BibTeX

@article{40a306c140c145a2809cb18c84f8e94b,
title = "Hintikka{\textquoteright}s Independence-Friendly Logic Meets Nelson{\textquoteright}s Realizability",
abstract = "Inspired by Hintikka{\textquoteright}s ideas on constructivism, we are going to {\textquoteleft}effectivize{\textquoteright} the game-theoretic semantics (abbreviated GTS) for independence-friendly first-order logic (IF-FOL), but in a somewhat different way than he did in the monograph {\textquoteleft}The Principles of Mathematics Revisited{\textquoteright}. First we show that Nelson{\textquoteright}s realizability interpretation—which extends the famous Kleene{\textquoteright}s realizability interpretation by adding {\textquoteleft}strong negation{\textquoteright}—restricted to the implication-free first-order formulas can be viewed as an effective version of GTS for FOL. Then we propose a realizability interpretation for IF-FOL, inspired by the so-called {\textquoteleft}trump semantics{\textquoteright} which was discovered by Hodges, and show that this trump realizability interpretation can be viewed as an effective version of GTS for IF-FOL. Finally we prove that the trump realizability interpretation for IF-FOL appropriately generalises Nelson{\textquoteright}s restricted realizability interpretation for the implication-free first-order formulas.",
keywords = "Constructivism, Game-theoretic semantics, Independence-friendly logic, Realizability, Strong negation, Trump semantics",
author = "Odintsov, {Sergei P.} and Speranski, {Stanislav O.} and Shevchenko, {Igor Yu}",
note = "The research of S. P. Odintsov was partially supported by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (Grant NSh-6848.2016.1). The research of S. O. Speranski was partially supported by the Alexander von Humboldt Foundation.",
year = "2018",
month = jun,
day = "1",
doi = "10.1007/s11225-017-9760-x",
language = "English",
volume = "106",
pages = "637--670",
journal = "Studia Logica",
issn = "0039-3215",
publisher = "Springer Netherlands",
number = "3",

}

RIS

TY - JOUR

T1 - Hintikka’s Independence-Friendly Logic Meets Nelson’s Realizability

AU - Odintsov, Sergei P.

AU - Speranski, Stanislav O.

AU - Shevchenko, Igor Yu

N1 - The research of S. P. Odintsov was partially supported by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (Grant NSh-6848.2016.1). The research of S. O. Speranski was partially supported by the Alexander von Humboldt Foundation.

PY - 2018/6/1

Y1 - 2018/6/1

N2 - Inspired by Hintikka’s ideas on constructivism, we are going to ‘effectivize’ the game-theoretic semantics (abbreviated GTS) for independence-friendly first-order logic (IF-FOL), but in a somewhat different way than he did in the monograph ‘The Principles of Mathematics Revisited’. First we show that Nelson’s realizability interpretation—which extends the famous Kleene’s realizability interpretation by adding ‘strong negation’—restricted to the implication-free first-order formulas can be viewed as an effective version of GTS for FOL. Then we propose a realizability interpretation for IF-FOL, inspired by the so-called ‘trump semantics’ which was discovered by Hodges, and show that this trump realizability interpretation can be viewed as an effective version of GTS for IF-FOL. Finally we prove that the trump realizability interpretation for IF-FOL appropriately generalises Nelson’s restricted realizability interpretation for the implication-free first-order formulas.

AB - Inspired by Hintikka’s ideas on constructivism, we are going to ‘effectivize’ the game-theoretic semantics (abbreviated GTS) for independence-friendly first-order logic (IF-FOL), but in a somewhat different way than he did in the monograph ‘The Principles of Mathematics Revisited’. First we show that Nelson’s realizability interpretation—which extends the famous Kleene’s realizability interpretation by adding ‘strong negation’—restricted to the implication-free first-order formulas can be viewed as an effective version of GTS for FOL. Then we propose a realizability interpretation for IF-FOL, inspired by the so-called ‘trump semantics’ which was discovered by Hodges, and show that this trump realizability interpretation can be viewed as an effective version of GTS for IF-FOL. Finally we prove that the trump realizability interpretation for IF-FOL appropriately generalises Nelson’s restricted realizability interpretation for the implication-free first-order formulas.

KW - Constructivism

KW - Game-theoretic semantics

KW - Independence-friendly logic

KW - Realizability

KW - Strong negation

KW - Trump semantics

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

U2 - 10.1007/s11225-017-9760-x

DO - 10.1007/s11225-017-9760-x

M3 - Article

AN - SCOPUS:85031416462

VL - 106

SP - 637

EP - 670

JO - Studia Logica

JF - Studia Logica

SN - 0039-3215

IS - 3

ER -

ID: 9890994