Hintikka's independence-friendly logic meets Nelson's realizability

DOI10.1007/s11225-017-9760-xzbMath1478.03056OpenAlexW2764097319MaRDI QIDQ1653658

Sergei P. Odintsov, Stanislav O. Speranski, Igor' Yur'evich Shevchenko

Publication date: 6 August 2018

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-017-9760-x

zbMATH Keywords

independence-friendly logicrealizabilitystrong negationgame-theoretic semanticsconstructivismtrump semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items

HYPE: a system of hyperintensional logic (with an application to semantic paradoxes), About effective versions of game theoretical semantics for first-order logic

Cites Work

• From IF to BI. A tale of dependence and separation
• Compositional semantics for a language of imperfect information
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification
• Constructible falsity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item