![]() ![]() We can conceive of possible worlds in various ways, depending on what we're interested in modelling. ![]() ![]() Semantically, these modal connectives are interpreted with respect to possible worlds. Now, in modal logic, we add two new unary connectives to our familiar language: So once we've fixed a truth value for each of the propositional variables, the truth value of any formula using those variables is deterministic. Ī typical (long-form) truth table would look something like this (using 0 for false and 1 for true): To start out, let's briefly recall the language and semantics of propositional logic, i.e., connectives and truth tables. This app is a graphical semantic calculator for a specific kind of modal logic, modal propositional logic, which extends propositional logic but lacks quantifiers ( ∀ and ∃). Modal logic is a type of symbolic logic for capturing inferences about necessity and possibility.Īs with other logical systems, the theory lies at the intersection of mathematics and philosophy, while important applications are found within computer science and linguistics. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2022
Categories |