Sahlqvist Formula
   HOME
*





Sahlqvist Formula
In modal logic, Sahlqvist formulas are a certain kind of modal formula with remarkable properties. The Sahlqvist correspondence theorem states that every Henrik Sahlqvist, Sahlqvist formula is Kripke semantics#Canonical models, canonical, and corresponds to a class of Kripke semantics, Kripke frames definable by a first-order logic, first-order formula. Sahlqvist's definition characterizes a decidable set of modal formulas with first-order correspondents. Since it is undecidable, by Chagrova's theorem, whether an arbitrary modal formula has a first-order correspondent, there are formulas with first-order frame conditions that are not Sahlqvist [Chagrova 1991] (see the examples below). Hence Sahlqvist formulas define only a (decidable) subset of modal formulas with first-order correspondents. Definition Sahlqvist formulas are built up from implications, where the consequent is ''positive'' and the antecedent is of a restricted form. * A ''boxed atom'' is a propositional atom prece ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Modal Logic
Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other systems by adding unary operators \Diamond and \Box, representing possibility and necessity respectively. For instance the modal formula \Diamond P can be read as "possibly P" while \Box P can be read as "necessarily P". Modal logics can be used to represent different phenomena depending on what kind of necessity and possibility is under consideration. When \Box is used to represent epistemic necessity, \Box P states that P is epistemically necessary, or in other words that it is known. When \Box is used to represent deontic necessity, \Box P states that P is a moral or legal obligation. In the standard relational semantics for modal logic, formulas are assigned truth values relative to a ''possible world''. A formula's truth value at ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Henrik Sahlqvist
Henrik is a male given name of Germanic origin, primarily used in Scandinavia, Estonia, Hungary and Slovenia. In Poland, the name is spelt Henryk but pronounced similarly. Equivalents in other languages are Henry (English), Heiki (Estonian), Heikki (Finnish), Henryk (Polish), Hendrik (Dutch), Heinrich (German), Enrico (Italian), Henri (French), Enrique (Spanish) and Henrique (Portuguese). It means 'Ruler of the home' or 'Lord of the house'. People named Henrik include: * Henrik, Prince Consort of Denmark (1934–2018) * Prince Henrik of Denmark (born 2009) * Henrik Agerbeck (born 1956), Danish footballer * Henrik Andersson (badminton) (born 1977), Swedish player * Henrik Christiansen (other) * Henrik Dagård (born 1969), Swedish decathlete * Henrik Dam (1895-1976), Danish biochemist, physiologist and Nobel laureate * Henrik Dettmann (born 1958), Finnish basketball coach * Henrik Otto Donner (1939-2013), Finnish composer and musician * Henrik Fisker (born 1963), Danish ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Kripke Semantics
Kripke semantics (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non-classical logic systems created in the late 1950s and early 1960s by Saul Kripke and André Joyal. It was first conceived for modal logics, and later adapted to intuitionistic logic and other non-classical systems. The development of Kripke semantics was a breakthrough in the theory of non-classical logics, because the model theory of such logics was almost non-existent before Kripke (algebraic semantics existed, but were considered 'syntax in disguise'). Semantics of modal logic The language of propositional modal logic consists of a countable set, countably infinite set of propositional variables, a set of truth-functional Logical connective, connectives (in this article \to and \neg), and the modal operator \Box ("necessarily"). The modal operator \Diamond ("possibly") is (classically) the duality (mathematics)#Duality in log ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

First-order Logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists''"'' is a quantifier, while ''x'' is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic. A theory about a topic is usually a first-order logic together with a specified domain of discourse (over which the quantified variables range), finitely many functions from that domain to itself, finitely many predicates defined on that domain, and a set of ax ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Decidable Set
In computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input, terminates after a finite amount of time (possibly depending on the given number) and correctly decides whether the number belongs to the set or not. A set which is not computable is called noncomputable or undecidable. A more general class of sets than the computable ones consists of the computably enumerable (c.e.) sets, also called semidecidable sets. For these sets, it is only required that there is an algorithm that correctly decides when a number ''is'' in the set; the algorithm may give no answer (but not the wrong answer) for numbers not in the set. Formal definition A subset S of the natural numbers is called computable if there exists a total computable function f such that f(x)=1 if x\in S and f(x)=0 if x\notin S. In other words, the set S is computable if and only if the indicator function \mathbb_ is computable. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Reflexive Relation
In mathematics, a binary relation ''R'' on a set ''X'' is reflexive if it relates every element of ''X'' to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations. Definitions Let R be a binary relation on a set X, which by definition is just a subset of X \times X. For any x, y \in X, the notation x R y means that (x, y) \in R while "not x R y" means that (x, y) \not\in R. The relation R is called if x R x for every x \in X or equivalently, if \operatorname_X \subseteq R where \operatorname_X := \ denotes the identity relation on X. The of R is the union R \cup \operatorname_X, which can equivalently be defined as the smallest (with respect to \subseteq) reflexive relation on X ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Symmetric Relation
A symmetric relation is a type of binary relation. An example is the relation "is equal to", because if ''a'' = ''b'' is true then ''b'' = ''a'' is also true. Formally, a binary relation ''R'' over a set ''X'' is symmetric if: :\forall a, b \in X(a R b \Leftrightarrow b R a) , where the notation aRb means that (a,b)\in R. If ''R''T represents the converse of ''R'', then ''R'' is symmetric if and only if ''R'' = ''R''T. Symmetry, along with reflexivity and transitivity, are the three defining properties of an equivalence relation. Examples In mathematics * "is equal to" (equality) (whereas "is less than" is not symmetric) * "is comparable to", for elements of a partially ordered set * "... and ... are odd": :::::: Outside mathematics * "is married to" (in most legal systems) * "is a fully biological sibling of" * "is a homophone of" * "is co-worker of" * "is teammate of" Relationship to asymmetric and antisymmetric relations By definition, a nonempty relation cannot be bot ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Transitive Relation
In mathematics, a relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Each partial order as well as each equivalence relation needs to be transitive. Definition A homogeneous relation on the set is a ''transitive relation'' if, :for all , if and , then . Or in terms of first-order logic: :\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc, where is the infix notation for . Examples As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy, too, is an ancestor of Carrie. On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can ''never'' be the birth parent of Claire. "Is ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Dense Order
In mathematics, a partial order or total order < on a X is said to be dense if, for all x and y in X for which x < y, there is a z in X such that x < z < y. That is, for any two elements, one less than the other, there is another element between them. For total orders this can be simplified to "for any two distinct elements, there is another element between them", since all elements of a total order are .


Example

The s as a linearly ordered set are a densely o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Church–Rosser Theorem
In lambda calculus, the Church–Rosser theorem states that, when applying reduction rules to terms, the ordering in which the reductions are chosen does not make a difference to the eventual result. More precisely, if there are two distinct reductions or sequences of reductions that can be applied to the same term, then there exists a term that is reachable from both results, by applying (possibly empty) sequences of additional reductions. The theorem was proved in 1936 by Alonzo Church and J. Barkley Rosser, after whom it is named. The theorem is symbolized by the adjacent diagram: If term ''a'' can be reduced to both ''b'' and ''c'', then there must be a further term ''d'' (possibly equal to either ''b'' or ''c'') to which both ''b'' and ''c'' can be reduced. Viewing the lambda calculus as an abstract rewriting system, the Church–Rosser theorem states that the reduction rules of the lambda calculus are confluent. As a consequence of the theorem, a term in the lambda calculu ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Normal Modal Logic
In logic, a normal modal logic is a set ''L'' of modal formulas such that ''L'' contains: * All propositional tautologies; * All instances of the Kripke schema: \Box(A\to B)\to(\Box A\to\Box B) and it is closed under: * Detachment rule (''modus ponens''): A\to B, A \in L implies B \in L; * Necessitation rule: A \in L implies \Box A \in L. The smallest logic satisfying the above conditions is called K. Most modal logics commonly used nowadays (in terms of having philosophical motivations), e.g. C. I. Lewis's S4 and S5, are normal (and hence are extensions of K). However a number of deontic and epistemic logic Epistemic modal logic is a subfield of modal logic that is concerned with reasoning about knowledge. While epistemology has a long philosophical tradition dating back to Ancient Greece, epistemic logic is a much more recent development with applica ...s, for example, are non-normal, often because they give up the Kripke schema. Every normal modal logic is regular and hen ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Elementary Class
In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory. Definition A class ''K'' of structures of a signature σ is called an elementary class if there is a first-order theory ''T'' of signature σ, such that ''K'' consists of all models of ''T'', i.e., of all σ-structures that satisfy ''T''. If ''T'' can be chosen as a theory consisting of a single first-order sentence, then ''K'' is called a basic elementary class. More generally, ''K'' is a pseudo-elementary class if there is a first-order theory ''T'' of a signature that extends σ, such that ''K'' consists of all σ-structures that are reducts to σ of models of ''T''. In other words, a class ''K'' of σ-structures is pseudo-elementary iff there is an elementary class ''K''' such that ''K'' consists of precisely the reducts to σ of the structures in ''K'''. For obvious reasons, elementary classes are also ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]