A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2017-12-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/4129/pdf |
| _version_ | 1797268668575383552 |
|---|---|
| author | Thomas Streicher |
| author_facet | Thomas Streicher |
| author_sort | Thomas Streicher |
| collection | DOAJ |
| description | We study a classical realizability model (in the sense of J.-L. Krivine)
arising from a model of untyped lambda calculus in coherence spaces. We show
that this model validates countable choice using bar recursion and bar
induction. |
| first_indexed | 2024-04-25T01:36:08Z |
| format | Article |
| id | doaj.art-f1e9599fc65f4151a5bfb81f06844519 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:36:08Z |
| publishDate | 2017-12-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-f1e9599fc65f4151a5bfb81f068445192024-03-08T09:52:12ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742017-12-01Volume 13, Issue 410.23638/LMCS-13(4:24)20174129A Classical Realizability Model arising from a Stable Model of Untyped Lambda CalculusThomas StreicherWe study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.https://lmcs.episciences.org/4129/pdfmathematics - category theorymathematics - logic |
| spellingShingle | Thomas Streicher A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus Logical Methods in Computer Science mathematics - category theory mathematics - logic |
| title | A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus |
| title_full | A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus |
| title_fullStr | A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus |
| title_full_unstemmed | A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus |
| title_short | A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus |
| title_sort | classical realizability model arising from a stable model of untyped lambda calculus |
| topic | mathematics - category theory mathematics - logic |
| url | https://lmcs.episciences.org/4129/pdf |
| work_keys_str_mv | AT thomasstreicher aclassicalrealizabilitymodelarisingfromastablemodelofuntypedlambdacalculus AT thomasstreicher classicalrealizabilitymodelarisingfromastablemodelofuntypedlambdacalculus |