Valid formulas, games and network protocols
| dc.creator | Krivine, Jean-Louis | |
| dc.creator | Legrandgérard, Yves | |
| dc.date | 2007-08-10 | |
| dc.date | 2007-11-14 | |
| dc.date.accessioned | 2026-07-07T08:42:31Z | |
| dc.date.available | 2026-07-07T08:42:31Z | |
| dc.description | We describe a remarkable relation between the notion of valid formula of predicate logic and the specification of network protocols. We give several examples such as the acknowledgement of one packet or of a sequence of packets. We show how to specify the composition of protocols. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/0708.1480 | |
| dc.identifier | http://arxiv.org/abs/0708.1480 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/141985 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Valid formulas, games and network protocols | |
| dc.type | text |