Graduate studies at Western
Studia Logica 81 (3):295 - 309 (2005)
|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.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
V. V. Rybakov (1995). Hereditarily Structurally Complete Modal Logics. Journal of Symbolic Logic 60 (1):266-288.
Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
Dominic Gregory (2001). Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators. Journal of Philosophical Logic 30 (1):57-78.
Stéphane Demri & Dov Gabbay (2000). On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. Studia Logica 66 (3):349-384.
Dorota Leszczyńska-Jasion (2009). A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S. Journal of Philosophical Logic 38 (2):151 - 177.
Nobu -Yuki Suzuki (1990). Kripke Bundles for Intermediate Predicate Logics and Kripke Frames for Intuitionistic Modal Logics. Studia Logica 49 (3):289 - 306.
Robert E. Byerly (1982). An Invariance Notion in Recursion Theory. Journal of Symbolic Logic 47 (1):48-66.
Added to index2009-01-28
Total downloads4 ( #189,291 of 739,406 )
Recent downloads (6 months)0
How can I increase my downloads?