Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2004
Springer

favoriteEmaildiscussreport

110views Education» more CORR 2004»

On Modal Logics of Partial Recursive Functions

13 years 4 months ago

On Modal Logics of Partial Recursive Functions

Download www2.mcdaniel.edu

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.

Pavel Naumov

Real-time Traffic

Classical Propositional Logic | CORR 2004 | Education | Partial Recursive Function | Propositional |

claim paper

Related Content

» Partial and Nested Recursive Function Definitions in Higherorder Logic

» Dynamic topological logics over spaces with continuous functions

» Partial Recursive Functions in HigherOrder Logic

» A Type of Partial Recursive Functions

» Linear Recursive Functions

» Computation by Prophecy

» Executing Higher Order Logic

» The Optimal Fixed Point Combinator

» A Relational Modal Logic for HigherOrder Stateful ADTs

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CORR
Authors	Pavel Naumov

Comments (0)