𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On complete theories with a finite number of denumerable models

✍ Scribed by M. G. Peretyat'kin


Publisher
Springer US
Year
1973
Tongue
English
Weight
961 KB
Volume
12
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Protocol insecurity with a finite number
✍ MichaΓ«l Rusinowitch; Mathieu Turuani πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 341 KB

We investigate the complexity of the protocol insecurity problem for a ΓΏnite number of sessions (ΓΏxed number of interleaved runs). We show that this problem is NP-complete with respect to a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports non-atom