On independence-friendly fixpoint logics (notice n° 1015210)
[ vue normale ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01145cam a2200169 4500500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250125141917.0 |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | fre |
| 042 ## - AUTHENTICATION CODE | |
| Authentication code | dc |
| 100 10 - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Bradfield, J. C. |
| Relator term | author |
| 245 00 - TITLE STATEMENT | |
| Title | On independence-friendly fixpoint logics |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Date of publication, distribution, etc. | 2004.<br/> |
| 500 ## - GENERAL NOTE | |
| General note | 18 |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Nous introduisons une extension aux points fixes de la logique IF (faite pour l’indépendance) de Hintikka et Sandu. Nous donnons des résultats sur sa complexité et son pouvoir expressif. Nous la relions aux jeux de parité à information imparfaite, et nous montrons une application à la définition d’un mu-calcul modal fait pour l’indépendance. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi. |
| 786 0# - DATA SOURCE ENTRY | |
| Note | Philosophia Scientiæ | 8-2 | 2 | 2004-10-01 | p. <br/>-<br/> | 1281-2463 |
| 856 41 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://shs.cairn.info/revue-philosophia-scientiae-2004-2-page-<br/>?lang=en&redirect-ssocas=7080">https://shs.cairn.info/revue-philosophia-scientiae-2004-2-page-<br/>?lang=en&redirect-ssocas=7080</a> |
Pas d'exemplaire disponible.
Réseaux sociaux