Coherent and finiteness spaces
This short note presents a new relation between coherent spaces and finiteness spaces. This takes the form of a functor from COH to FIN commuting with the additive and multiplicative structure of linear logic. What makes this correspondence possible and conceptually interesting is the use of the inf...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2011-09-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/1131/pdf |
| _version_ | 1797268687299805184 |
|---|---|
| author | Pierre Hyvernat |
| author_facet | Pierre Hyvernat |
| author_sort | Pierre Hyvernat |
| collection | DOAJ |
| description | This short note presents a new relation between coherent spaces and
finiteness spaces. This takes the form of a functor from COH to FIN commuting
with the additive and multiplicative structure of linear logic. What makes this
correspondence possible and conceptually interesting is the use of the infinite
Ramsey theorem. Along the way, the question of the cardinality of the
collection of finiteness spaces on N is answered. Basic knowledge about
coherent spaces and finiteness spaces is assumed. |
| first_indexed | 2024-04-25T01:36:26Z |
| format | Article |
| id | doaj.art-3f385135a5ce4573824d45dda111b5d9 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:36:26Z |
| publishDate | 2011-09-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-3f385135a5ce4573824d45dda111b5d92024-03-08T09:17:23ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742011-09-01Volume 7, Issue 310.2168/LMCS-7(3:15)20111131Coherent and finiteness spacesPierre HyvernatThis short note presents a new relation between coherent spaces and finiteness spaces. This takes the form of a functor from COH to FIN commuting with the additive and multiplicative structure of linear logic. What makes this correspondence possible and conceptually interesting is the use of the infinite Ramsey theorem. Along the way, the question of the cardinality of the collection of finiteness spaces on N is answered. Basic knowledge about coherent spaces and finiteness spaces is assumed.https://lmcs.episciences.org/1131/pdfcomputer science - logic in computer sciencemathematics - logicf.4.1, f.3.2 |
| spellingShingle | Pierre Hyvernat Coherent and finiteness spaces Logical Methods in Computer Science computer science - logic in computer science mathematics - logic f.4.1, f.3.2 |
| title | Coherent and finiteness spaces |
| title_full | Coherent and finiteness spaces |
| title_fullStr | Coherent and finiteness spaces |
| title_full_unstemmed | Coherent and finiteness spaces |
| title_short | Coherent and finiteness spaces |
| title_sort | coherent and finiteness spaces |
| topic | computer science - logic in computer science mathematics - logic f.4.1, f.3.2 |
| url | https://lmcs.episciences.org/1131/pdf |
| work_keys_str_mv | AT pierrehyvernat coherentandfinitenessspaces |