On modal logics of partial recursive functions
On modal logics of partial recursive functions
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.
Curry-Howard isomorphism, Modal logic, Recursive function
295-309
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
December 2005
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
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.
This record has no associated files available for download.
More information
Published date: December 2005
Keywords:
Curry-Howard isomorphism, Modal logic, Recursive function
Identifiers
Local EPrints ID: 480222
URI: http://eprints.soton.ac.uk/id/eprint/480222
ISSN: 0039-3215
PURE UUID: 7c2374ae-b46e-44a9-99a3-47f2860d2218
Catalogue record
Date deposited: 01 Aug 2023 17:08
Last modified: 17 Mar 2024 04:10
Export record
Altmetrics
Contributors
Author:
Pavel Naumov
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics