𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of decidability of the traditional calculus of names

✍ Scribed by Bogusław Iwanuś


Publisher
Springer Netherlands
Year
1973
Tongue
English
Weight
751 KB
Volume
32
Category
Article
ISSN
0039-3215

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the decidability of process equivalen
✍ Mads Dam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 994 KB

We present general results for showing process equivalences applied to the finite control fragment of the z-calculus decidable. Firstly, a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Se