You are not currently logged in.
Access JSTOR through your library or other institution:
On Modal Logics of Partial Recursive Functions
Studia Logica: An International Journal for Symbolic Logic
Vol. 81, No. 3 (Dec., 2005), pp. 295-309
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016752
Page Count: 15
You can always find the topics here!Topics: Recursive functions, Modal logic, Logical theorems, Logic, Semantics, Induction assumption, Propositional logic, Mathematical functions, Logical givens, Rules of inference
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Studia Logica: An International Journal for Symbolic Logic © 2005 Springer