✦ 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
DOI: 10.1007/bf02123833

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decidability of mean value calculus

✍ Xiaoshan Li 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 514 KB

The systems of modal calculus of names.

The systems of modal calculus of names. II

✍ Swietłana Lebiediewa 📂 Article 📅 1969 🏛 Springer Netherlands 🌐 English ⚖ 747 KB

The systems of modal calculus of names.

The systems of modal calculus of names. I

✍ Swietłana Lebiediewa 📂 Article 📅 1969 🏛 Springer Netherlands 🌐 English ⚖ 937 KB

Proof of Ł-decidability of Lewis system

Proof of Ł-decidability of Lewis system S5

✍ Jerzy Słupecki; Grzegorz Bryll 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 312 KB

On the decidability of process equivalen

On the decidability of process equivalences for the π-calculus

✍ 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

Decidability of the restriction equation

Decidability of the restriction equational theory in the partial lambda calculus

✍ Ramón Pino Perez 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 954 KB