David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 38 (1):37 - 47 (1979)
The veiled recession frame has served several times in the literature to provide examples of modal logics failing to have certain desirable properties. Makinson  was the first to use it in his presentation of a modal logic without the finite model property. Thomason  constructed a (rather complicated) logic whose Kripke frames have an accessibility relation which is reflexive and transitive, but which is satisfied by the (non-transitive) veiled recession frame, and hence incomplete. In Van Benthem  the frame was an essential tool to find simple examples of incomplete logics, axiomatized by a formula in two proposition letters of degree 2, or by a formula in one proposition letter of degree 4 (the degree of a modal formula is the maximal number of nested occurrences of the necessity operator in ). In  we showed that the modal logic determined by the veiled recession frame is incomplete, and besides that, is an immediate predecessor of classical logic (or, more precisely, the modal logic axiomatized by the formula pp), and hence is a logic, maximal among the incomplete ones. Considering the importance of the modal logic determined by the veiled recession frame, it seems worthwhile to ask for an axiomatization, and in particular, to answer the question if it is finitely axiomatizable. In the present paper we find a finite axiomatization of the logic, and in fact, a rather simple one consisting of formulas in at most two proposition letters and of degree at most three.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
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|
References found in this work BETA
David Makinson (1969). A Normal Modal Calculus Between T and S4 Without the Finite Model Property. Journal of Symbolic Logic 34 (1):35-38.
S. K. Thomason (1974). An Incompleteness Theorem in Modal Logic. Theoria 40 (1):30-34.
Citations of this work BETA
No citations found.
Similar books and articles
Bruce M. Kapron (1987). Modal Sequents and Definability. Journal of Symbolic Logic 52 (3):756-762.
A. V. Chagrov & L. A. Chagrova (1995). Algorithmic Problems Concerning First-Order Definability of Modal Formulas on the Class of All Finite Frames. Studia Logica 55 (3):421 - 448.
Robert Demolombe, Andreas Herzig & Ivan Varzinczak (2003). Regression in Modal Logic. Journal of Applied Non-Classical Logic 13 (2):165-185.
W. J. Blok (1980). The Lattice of Modal Logics: An Algebraic Investigation. Journal of Symbolic Logic 45 (2):221-236.
George Goguadze, Carla Piazza & Yde Venema (2003). Simulating Polyadic Modal Logics by Monadic Ones. Journal of Symbolic Logic 68 (2):419-462.
M. J. Cresswell (1995). Incompleteness and the Barcan Formula. Journal of Philosophical Logic 24 (4):379 - 403.
Fabio Bellissima & Massimo Mirolli (1983). On the Axiomatization of Finitek-Frames. Studia Logica 42 (4):383 - 388.
Tatsuya Shimura (2000). Kripke Incompleteness of Predicate Extensions of the Modal Logics Axiomatized by a Canonical Formula for a Frame with a Nontrivial Cluster. Studia Logica 65 (2):237-247.
Beihai Zhou (1999). Grafted Frames and S1-Completeness. Journal of Symbolic Logic 64 (3):1324-1338.
R. Hirsch, I. Hodkinson & A. Kurucz (2002). On Modal Logics Between K × K × K and $S5 \Times S5 \Times S5$. Journal of Symbolic Logic 67 (1):221 - 234.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #445,994 of 1,102,868 )
Recent downloads (6 months)0
How can I increase my downloads?