On Modal Logics of Partial Recursive Functions
| dc.creator | Naumov, Pavel | |
| dc.date | 2004-07-12 | |
| dc.date.accessioned | 2026-07-07T03:21:34Z | |
| dc.date.available | 2026-07-07T03:21:34Z | |
| dc.description | The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both of them semantically complete modal logics are described and decidability of these logics is established. | |
| dc.identifier | https://arxiv.org/abs/cs/0407031 | |
| dc.identifier | http://arxiv.org/abs/cs/0407031 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32245 | |
| dc.subject | Logic in Computer Science | |
| dc.title | On Modal Logics of Partial Recursive Functions | |
| dc.type | text |