- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A note on the completeness of Kozen's axiomatisation of the propositional μ-calculus
Bulletin of Symbolic Logic 2 (3):349-366 (1996)
Abstract
The propositional μ -calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is completeLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Axiomatisation and decidability off andp in cyclical time.Mark Reynolds - 1994 - Journal of Philosophical Logic 23 (2):197 - 224.
Axiomatising first-order temporal logic: Until and since over linear time.Mark Reynolds - 1996 - Studia Logica 57 (2-3):279 - 302.
Absolute probability functions for intuitionistic propositional logic.Peter Roeper & Hugues Leblanc - 1999 - Journal of Philosophical Logic 28 (3):223-234.
Sequential Dynamic Logic.Alexander Bochman & Dov M. Gabbay - 2012 - Journal of Logic, Language and Information 21 (3):279-298.
A modal calculus analogous to k4w, based on intuitionistic propositional logic, iℴ.Aldo Ursini - 1979 - Studia Logica 38 (3):297 - 311.
Completeness theorems via the double dual functor.Adriana Galli, Marta Sagastume & Gonzalo E. Reyes - 2000 - Studia Logica 64 (1):61-81.
A Simple Proof of Completeness and Cut-elimination for Propositional G¨ odel Logic.Arnon Avron - unknown
On Interpreting the S5 Propositional Calculus: an essay in philosophical logic.Michael J. Carroll - 1976 - Dissertation, University of Iowa
A finite model theorem for the propositional μ-calculus.Dexter Kozen - 1988 - Studia Logica 47 (3):233 - 241.
Analytics
Added to PP
2009-01-28
Downloads
102 (#172,633)
6 months
6 (#531,961)
2009-01-28
Downloads
102 (#172,633)
6 months
6 (#531,961)
Historical graph of downloads
References found in this work
Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.
A finite model theorem for the propositional μ-calculus.Dexter Kozen - 1988 - Studia Logica 47 (3):233 - 241.
Axiomatising Linear Time Mu-Calculus.Roope Kaivola - 1995 - Lfcs, Dept. Of Computer Science, University of Edinburgh.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c88c7cdf7-qczmr uwo