On completeness of reducibility candidates as a semantics of strong normalization
This paper defines a sound and complete semantic criterion, based on reducibility candidates, for strong normalization of theories expressed in minimal deduction modulo \`a la Curry. The use of Curry-style proof-terms allows to build this criterion on the classic notion of pre-Heyting algebras and m...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Logical Methods in Computer Science e.V.
2012-02-01
|
| Serier: | Logical Methods in Computer Science |
| Fag: | |
| Online adgang: | https://lmcs.episciences.org/845/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|