Please use this identifier to cite or link to this item:
doi:10.22028/D291-38408 | Title: | Kripke Semantics for Intersection Formulas |
| Author(s): | Dudenhefner, Andrej Urzyczyn, Paweł |
| Language: | English |
| Title: | ACM Transactions on Computational Logic |
| Volume: | 22 |
| Issue: | 3 |
| Publisher/Platform: | Association for Computing Machinery (ACM) |
| Year of Publication: | 2021 |
| Free key words: | Intersection types games in logic Kripke models |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Conference Paper |
| Abstract: | We propose a notion of the Kripke-style model for intersection logic. Using a game interpretation, we prove soundness and completeness of the proposed semantics. In other words, a formula is provable (a type is inhabited) if and only if it is forced in every model. As a by-product, we obtain another proof of normalization for the Barendregt–Coppo–Dezani intersection type assignment system. |
| DOI of the first publication: | 10.1145/3453481 |
| URL of the first publication: | http://dx.doi.org/10.1145/3453481 |
| Link to this record: | urn:nbn:de:bsz:291--ds-384084 hdl:20.500.11880/34663 http://dx.doi.org/10.22028/D291-38408 |
| ISSN: | 1557-945X 1529-3785 |
| Date of registration: | 6-Dec-2022 |
| Notes: | ACM Transactions on Computational Logic, Vol. 22, No. 3, 2021 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Professorship: | MI - Keiner Professur zugeordnet |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 3453481.pdf | 362,22 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
