Loading...
Please wait, while we are loading the content...
Similar Documents
Realizability algebras III: some examples
| Content Provider | Scilit |
|---|---|
| Author | Krivine, Jean-Louis |
| Copyright Year | 2016 |
| Description | We use the technique of “classical realizability” to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, which are not obtainable by forcing. This gives also a new method to get programs from proofs of arithmetical formulas with dependent choice. |
| Related Links | http://arxiv.org/pdf/1210.5065 https://www.cambridge.org/core/services/aop-cambridge-core/content/view/09A7FECCD5DBB4F51AB4D920624CD202/S0960129516000050a.pdf/div-class-title-realizability-algebras-iii-some-examples-div.pdf |
| Ending Page | 76 |
| Page Count | 32 |
| Starting Page | 45 |
| ISSN | 09601295 |
| e-ISSN | 14698072 |
| DOI | 10.1017/s0960129516000050 |
| Journal | Mathematical Structures in Computer Science |
| Issue Number | 1 |
| Volume Number | 28 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2018-01-01 |
| Access Restriction | Open |
| Subject Keyword | Mathematical Structures in Computer Science |
| Content Type | Text |
| Resource Type | Article |
| Subject | Mathematics Computer Science Applications |