Abstract
Possible world semantics of logical languages introduced by Kanger and Kripke around 1960 is the most widely used technique for formal presentation of nonclassical logics. In spite of some shortcomings connected with the incompleteness phenomenon, it provides an intuitively clear interpretation of the fact that a formula is satisfied in some possible worlds and it might not be satisfied in some of the others. With this interpretation formulas can be treated as those subsets of a universe of possible worlds in which they are true. In most of the possible world models the truth conditions for the intensional propositional operations are articulated in terms of properties of a binary or ternary accessibility relation between possible worlds. It follows that from a formal point of view possible world semantical structures are not uniform. The part responsible for the extensional fragment of a logic under consideration determines a Boolean algebra of sets, and the part responsible for the intensional fragment refers to an algebra of relations. Our main objective in the present paper is to develop a unifying algebraic treatment of both extensional and intensional parts of logical systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Burgess, P.: 1979, `Logic and Time’, Journal of Symbolic Logic 44, 566–581.
Epstein, G.: 1960, ‘The Lattice Theory of Post Algebras’, Transactions of the American Mathematical Society 95, 300–317.
Gargov, G., Passy, S., and Tinchev, T.: 1986, ‘Modal Environment for Boolean Speculations’. In: Skordev, D. (Ed.) Mathematical Logic and Applications. Proceedings of the 1986 Gödel Conference, Druzhba, Bulgaria. Plenum Press, New York.
Harel, D.: 1979, ‘First Order Dynamic Logic’. Lecture Notes in Computer Science 69, Springer, Berlin-Heidelberg-New York.
Hoare, C. A. R. and Jifeng, H.: 1986, ‘The Weakest Prespecification’, Fundamenta Informaticae IX, Part I: 51–84, Part II: 217–262.
Humberstone, I. L.: 1983, ‘Inaccessible Worlds’, Notre Dame Journal of Formal Logic 24, 346–352.
Jónsson, B.: 1982, ‘Varieties of Relation Algebras’, Algebra Universalis 15, 273–298.
Kripke, S.: 1963, ‘Semantical Analysis of Modal Logic I’, Zeitschrift fiir Mathematische Logik und Grundlagen der Mathematik 9, 67–96.
Kripke, S.: 1965, ‘Semantical Analysis of Intuitionistic Logic I’. In: Crossley, J. N. and Dummet
M. A. (Eds.) Formal Systems and Recursive Functions. North Holland, Amsterdam. Lyndon, R. C.: 1950, The Representation of Relation Algebras, Part I, Annals of Mathematics 51, 707–729, Part II: ibidem, 63, 294–307.
Maximova, L. and Vakarelov, D.: 1974, `Semantics for w+-Valued Predicate Calculi’, Bulletin of the PAS, Ser. Math. XXII, 765–771.
Monk, D. (1964), ‘On Representable Relation Algebras’, Michigan Mathematical Journal 11, 207–210.
Monk, D.: 1969, Nonfinitizability of Classes of Representable Cylindric Algebras’, Journal of Symbolic Logic 34, 331–343.
Orlowska, E.: 1985, `Logic of Nondeterministic Information’, Studia Logica XLIV, 93–102. Orlowska, E.: 1988, `Relational Interpretation of Modal Logics’. In: Andreka, H., Monk, D., and
Nemeti, I. (Eds.) Algebraic Logic. North Holland, Amsterdam, pp. 443–471. See also Bulletin of the Section of Logic 17 (1), (1988), 2–14.
Orlowska, E.: 1990, `Algebraic Aspects of the Relational Knowledge Representation: Modal Relation Algebras’. In: Pearce, D. and Wansing, H. (Eds.) Proceedings First All-Berlin Workshop on Nonclassical Logic and Information Processing, Berlin. Lecture Notes in Artificial Intelligence, Springer, Berlin-Heidelberg-New York.
Orlowska, E.: 1991, E.: 1991, `Post Relation Algebras and Their Proof System’, Proceedings of the 21st International Symposium on Multiple-Valued Logic, Victoria, Canada, pp. 298–305. See also Bulletin of the Section of Logic 20 (1), (1991), 14–22.
Orlowska, E.: 1992a, E.: 1992a, `Dynamic Logic with Program Specifications and Its Relational Proof System’, Journal of Applied Non-Classical Logics, forthcoming. See also Bulletin of the Section of Logic 18 (4), (1989), 132–137.
Orlowska, E.: 1992b, E.: 1992b, `Relational Proof System for Relevant Logics’, Journal of Symbolic Logic 57, 1425–1440. See also Bulletin of the Section of Logic 19 (2), (1990), 39–49.
Pawlak, Z.: 1991, Rough Sets, Kluwer, Dordrecht.
Post, E.: 1921, `Introduction to a General Theory of Elementary Propositions’, American Journal of Mathematics 43, 163–185.
Pratt, V. R.: 1976, `Semantical Considerations on Floyd-Hoare Logic’, Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pp. 109–121.
Rasiowa, H.: 1973, `On Generalized Post Algebras of Order w+ and w+-Valued Predicate Calculi’, Bulletin of the PAS, Ser. Math. XXI, 209–219.
Routley, R. and Meyer, R. K.: 1973, `The Semantics of Entailment’. In: Leblanc, H. (Ed.) Truth, Syntax and Modality. North Holland, Amsterdam, pp. 199–243.
Tarski, A.: 1941, `On the Calculus of Relations’, Journal of Symbolic Logic 6, 73–89.
Tarski, A.: 1955, `Contributions to the Theory of Models’, lndagationes Mathematicae 17, 56–64.
Urquhart, A.: 1972, `Semantics for Relevant Logics’, Journal of Symbolic Logic 37, 159–169.
Vakarelov, D.: 1989, `Modal Logics for Knowledge Representation’. Lecture Notes in Computer Science 363, Springer, Berlin-Heidelberg-New York, 257–277.
Van Benthem, J.: 1984, `Correspondence Theory’. In: Gabbay, D. and Guenther, F. (Eds) Handbook of Philosophical Logic vol. II. Reidel, Dordrecht, pp. 167–247.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Orłowska, E. (1994). Relational Semantics for Nonclassical Logics: Formulas are Relations. In: Woleński, J. (eds) Philosophical Logic in Poland. Synthese Library, vol 228. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8273-5_11
Download citation
DOI: https://doi.org/10.1007/978-94-015-8273-5_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4276-7
Online ISBN: 978-94-015-8273-5
eBook Packages: Springer Book Archive