- 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 finite model theorem for the propositional μ-calculus
Studia Logica 47 (3):233 - 241 (1988)
Abstract
We prove a finite model theorem and infinitary completeness result for the propositional -calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of well-quasi-orders.My notes
Similar books and articles
Systematization of finite many-valued logics through the method of tableaux.Walter A. Carnielli - 1987 - Journal of Symbolic Logic 52 (2):473-493.
The abstract variable-binding calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.
A propositional logic with explicit fixed points.Albert Visser - 1981 - Studia Logica 40 (2):155 - 175.
The finite model property for the implicational fragment of IPC without exchange and contraction.C. van Alten & J. Raftery - 1999 - Studia Logica 63 (2):213-222.
A modal sequent calculus for a fragment of arithmetic.G. Sambin & S. Valentini - 1980 - Studia Logica 39 (2-3):245-256.
Analytics
Added to PP
2009-01-28
Downloads
38 (#408,165)
6 months
4 (#818,853)
2009-01-28
Downloads
38 (#408,165)
6 months
4 (#818,853)
Historical graph of downloads
Citations of this work
Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
Undecidability results on two-variable logics.Erich Grädel, Martin Otto & Eric Rosen - 1999 - Archive for Mathematical Logic 38 (4-5):313-354.
On the Modal Definability of Simulability by Finite Transitive Models.David Fernández Duque - 2011 - Studia Logica 98 (3):347-373.
The Modal μ-Calculus Hierarchy over Restricted Classes of Transition Systems.Luca Alberucci & Alessandro Facchini - 2009 - Journal of Symbolic Logic 74 (4):1367 - 1400.
Completions of μ-algebras.Luigi Santocanale - 2008 - Annals of Pure and Applied Logic 154 (1):27-50.
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-7c76586df8-5tf24 uwo