Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T02:21:33.922Z Has data issue: false hasContentIssue false

ON DEFINABILITY IN MULTIMODAL LOGIC

Published online by Cambridge University Press:  05 October 2009

JOSEPH Y. HALPERN*
Affiliation:
Computer Science Department, Cornell University
DOV SAMET*
Affiliation:
The Faculty of Management, Tel Aviv University
ELLA SEGEV*
Affiliation:
Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology
*
*COMPUTER SCIENCE DEPARTMENT, CORNELL UNIVERSITY, ITHACA, NY 14853 E-mail: halpern@cs.cornell.edu
†THE FACULTY OF MANAGEMENT, TEL AVIV UNIVERSITY, TEL AVIV, 69978, ISRAEL E-mail: samet@post.tau.ac.il
‡FACULTY OF INDUSTRIAL ENGINEERING AND MANAGEMENT, TECHNION—ISRAEL INSTITUTE OF TECHNOLOGY, ISRAEL E-mail: esegev@ie.technion.ac.il
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, reducibility, is introduced; it is shown that in multimodal logics, explicit definability is equivalent to the combination of implicit definability and reducibility. The three notions of definability are characterized semantically using (modal) algebras. The use of algebras, rather than frames, is shown to be necessary for these characterizations.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009