Hintikka's independence-friendly logic meets Nelson's realizability (Q1653658)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hintikka's independence-friendly logic meets Nelson's realizability |
scientific article; zbMATH DE number 6914013
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hintikka's independence-friendly logic meets Nelson's realizability |
scientific article; zbMATH DE number 6914013 |
Statements
Hintikka's independence-friendly logic meets Nelson's realizability (English)
0 references
6 August 2018
0 references
The paper established Nelson's realizability interpretation restricted to the implication-free first-order formulas, which can be viewed as an effective version of GTS for FOL. It proposed a realizability interpretation for IF-FOL, and showed that this trump realizability interpretation can be viewed as an effective version of GTS for IF-FOL. The trump realizability in fact can be seen as a generalization of Nelson's restricted realizability. I think that this paper contributes to the theory of independence-friendly logic, and hence has a positive effect on the development of semantics of IF-FOL.
0 references
independence-friendly logic
0 references
game-theoretic semantics
0 references
trump semantics
0 references
constructivism
0 references
realizability
0 references
strong negation
0 references
0.8902029
0 references
0.8902029
0 references
0 references
0.86662805
0 references
0.8658315
0 references
0.85960877
0 references
0.8594778
0 references
0.8567579
0 references