A typed calculus based on a fragment of linear logic
β Scribed by Ugo Solitro
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 469 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper treats a kind of a modal logic based on the intuitionistic propositional logic which arose from the "provability" predicate in the first order arithmetic. The semantics of this calculus is presented in both a relational and an algebraic way. Completeness theorems, existence of a characte
The present paper contains an investigation of a three-valued logical calculus (the ~ system) previously described by the author [RecueHMathdmatique 4 (46), 2 (1938)1. A constructive consistence proof is given for a part of this calculus rendering the results previously published concerning the Rus
Cliff Jones has proposed transformations between concrete programs and general transformation rules that increase concurrency in a system of objects, and has raised the challenge of how to prove their validity. We present a proof of correctness of the hardest of Jones's concrete transformations. The