On Modal Logics of Partial Recursive Functions

Details On Modal Logics of Partial Recursive Functions On Modal Logics of Partial Recursive Functions

2004-07-12

arxiv.org/abs/cs/0407031v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Modal Logics of Partial Recursive Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Modal Logics of Partial Recursive Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Modal Logics of Partial Recursive Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-140925