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 | Philosophy Logic Mathematical Logic and Foundations Computational Linguistics |
| Categories | (categorize this paper) |
| DOI | 10.1007/s11225-005-4646-8 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 57,041
External links
- From the Publisher via CrossRef (no proxy)
- arxiv.org
(no proxy) - link.springer.com (no proxy)
- link.springer.com [2] (no proxy)
- jstor.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
The Algebra of Topology.J. C. C. Mckinsey & Alfred Tarski - 1944 - Annals of Mathematics, Second Series 45:141-191.
The Formulæ-as-Types Notion of Construction.W. A. Howard - 1995 - In Philippe De Groote (ed.), The Curry-Howard Isomorphism. Academia.
Combinatory Logic, Volume I.Haskell B. Curry, Robert Feys & William Craig - 1959 - Philosophical Review 68 (4):548-550.
View all 9 references / Add more references
Citations of this work BETA
On Modal Logic of Deductive Closure.Pavel Naumov - 2006 - Annals of Pure and Applied Logic 141 (1):218-224.
Similar books and articles
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
Review: Louise Hay, On Creative Sets and Indices of Partial Recursive Functions; Louise Hay, Isomorphism Types of Index Sets of Partial Recursive Functions; Louise Hay, Index Sets of Finite Classes of Recursively Enumerable Sets. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.
An Invariance Notion in Recursion Theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Non-Primitive Recursive Decidability of Products of Modal Logics with Expanding Domains.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2006 - Annals of Pure and Applied Logic 142 (1):245-268.
A Mechanization of Strong Kleene Logic for Partial Functions.Manfred Kerber Michael Kohlhase - unknown
Inconsistency-Adaptive Modal Logics. On How to Cope with Modal Inconsistency.Hans Lycke - 2010 - Logic and Logical Philosophy 19 (1-2):31-61.
A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
Partial Recursive Functions and Ω-Functions.C. H. Applebaum & J. C. E. Dekker - 1970 - Journal of Symbolic Logic 35 (4):559-568.
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.
Restricted Classical Modal Logics.Cezar Mortari - 2007 - Logic Journal of the IGPL 15 (5-6):741-757.
Probabilistic Canonical Models for Partial Logics.François Lepage & Charles Morgan - 2003 - Notre Dame Journal of Formal Logic 44 (3):125-138.
Analytics
Added to PP index
2009-01-28
Total views
23 ( #451,971 of 2,410,743 )
Recent downloads (6 months)
1 ( #538,938 of 2,410,743 )
2009-01-28
Total views
23 ( #451,971 of 2,410,743 )
Recent downloads (6 months)
1 ( #538,938 of 2,410,743 )
How can I increase my downloads?
Downloads
