On Modal Logics of Partial Recursive Functions
Logic in Computer Science
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.cs/0407031,
title = {On Modal Logics of Partial Recursive Functions},
author = {Pavel Naumov},
journal= {arXiv preprint arXiv:cs/0407031},
year = {2007}
}