Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Kripke semantics
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Multimodal logics=== {{See also|Multimodal logic}} Kripke semantics has a straightforward generalization to logics with more than one modality. A Kripke frame for a language with <math>\{\Box_i\mid\,i\in I\}</math> as the set of its necessity operators consists of a non-empty set ''W'' equipped with binary relations ''R<sub>i</sub>'' for each ''i'' β ''I''. The definition of a satisfaction relation is modified as follows: : <math>w\Vdash\Box_i A</math> if and only if <math>\forall u\,(w\;R_i\;u\Rightarrow u\Vdash A).</math> A simplified semantics, discovered by Tim Carlson, is often used for polymodal [[provability logic]]s. A '''Carlson model''' is a structure <math>\langle W,R,\{D_i\}_{i\in I},\Vdash\rangle</math> with a single accessibility relation ''R'', and subsets ''D<sub>i</sub>'' β ''W'' for each modality. Satisfaction is defined as : <math>w\Vdash\Box_i A</math> if and only if <math>\forall u\in D_i\,(w\;R\;u\Rightarrow u\Vdash A).</math> Carlson models are easier to visualize and to work with than usual polymodal Kripke models; there are, however, Kripke complete polymodal logics which are Carlson incomplete.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)