Theory of everything (philosophy): Difference between revisions
I don't see how a link to the "Meaning of Life" page and a link to Douglas Adams' reference of it has anything to do with a philosophical TOE. |
en>Materialscientist m Reverted edits by 122.163.194.74 (talk) to last version by 112.213.199.232 |
||
Line 1: | Line 1: | ||
In [[theoretical computer science]], the '''modal μ-calculus''' ('''Lμ''', '''L<sub>μ</sub>''', sometimes just '''μ-calculus''', although this can have a more general meaning) is an extension of [[propositional logic|propositional]] [[modal logic]] (with [[Multimodal logic|many modalities]]) by adding a [[least fixpoint]] operator μ and a [[greatest fixpoint]] operator <math>\nu</math>, thus a [[fixed-point logic]]. | |||
The (propositional, modal) μ-calculus originates with [[Dana Scott]] and [[Jaco de Bakker]],<ref>Kozen p. 333.</ref> and was further developed by [[Dexter Kozen]] into the version most used nowadays. It is used to describe properties of [[labelled transition system]]s and for [[model checking|verifying]] these properties. Many [[temporal logic]]s can be encoded in the μ-calculus, including [[CTL*]] and its widely used fragments—[[linear temporal logic]] and [[computational tree logic]].<ref>Clarke p.108, Theorem 6; Emerson p. 196</ref> | |||
An algebraic view is to see it as an [[universal algebra|algebra]] of [[monotonic function]]s over a [[complete lattice]], with operators consisting of [[functional composition]] plus the least and greatest fixed point operators; from this viewpoint, the modal μ-calculus is over the lattice of a [[power set algebra]].<ref>Arnold and Niwiński, pp. viii-x and chapter 6</ref> The [[game semantics]] of μ-calculus is related to [[two-player game]]s with [[perfect information]], particularly infinite [[parity game]]s.<ref>Arnold and Niwiński, pp. viii-x and chapter 4</ref> | |||
== Syntax == | |||
Let ''P'' (propositions) and ''A'' (actions) be two finite sets of symbols, and let ''V'' be a countably infinite set of variables. The set of formulas of (propositional, modal) μ-calculus is defined as follows: | |||
* each proposition and each variable is a formula; | |||
* if <math>\phi</math> and <math>\psi</math> are formulas, then <math>\phi \wedge \psi</math> is a formula. | |||
* if <math>\phi</math> is a formula, then <math>\neg \phi</math> is a formula; | |||
* if <math>\phi</math> is a formula and <math>a</math> is an action, then <math>[a] \phi</math> is a formula;(pronounced either: <math>a</math> box <math>\phi </math> or after <math>a</math> necessarily <math>\phi</math>) | |||
* if <math>\phi</math> is a formula and <math>Z</math> a variable, then <math>\nu Z. \phi</math> is a formula, provided that every free occurrence of <math>Z</math> in <math>\phi</math> occurs positively, i.e. within the scope of an even number of negations. | |||
(The notions of free and bound variables are as usual, where <math>\nu</math> is the only binding operator.) | |||
Given the above definitions, we can enrich the syntax with: | |||
* <math>\phi \lor \psi</math> meaning <math>\neg (\neg \phi \land \neg \psi)</math> | |||
* <math>\langle a \rangle \phi</math> (pronounced either: <math>a</math> diamond <math>\phi </math> or after <math>a</math> possibly <math>\phi</math>) meaning <math>\neg [a] \neg \phi</math> | |||
* <math>\mu Z. \phi</math> means <math>\neg \nu Z. \neg \phi [Z:=\neg Z]</math>, where <math>\phi [Z:=\neg Z]</math> means substituting <math>\neg Z</math> for ''Z'' in all [[free occurrence]]s of ''Z'' in <math>\phi </math>. | |||
The first two formulas are the familiar ones from the classical [[propositional calculus]] and respectively the minimal [[multimodal logic]] '''K'''. | |||
The notation <math>\mu Z. \phi</math> (and its dual) are inspired from the [[lambda calculus]]; the intent is to denote the least (and respectively greatest) fixed point of the expression <math>\phi</math> where the "minimization" (and respectively "maximization") are in the variable ''Z'', much like in lambda calculus <math>\lambda Z. \phi</math> is a function with formula <math>\phi</math> in [[Lambda_calculus#Free_and_bound_variables|bound variable]] ''Z'';<ref>Arnold and Niwiński, p. 14</ref> see the denotational semantics below for details. | |||
== Denotational semantics == | |||
Models of (propositional) μ-calculus is given are [[labelled transition system]]s <math>(S, R, V)</math> where: | |||
* <math>S</math> is a set of states; | |||
* <math>R</math> maps to each label <math>a</math> a relation on <math>S</math>; | |||
* <math> V : \mbox{Var} \rightarrow 2^S </math>, maps to each proposition <math>p \in \mbox{Prop}</math> the set of states where the proposition is true. | |||
Given a labelled transition system <math>(S, R, V)</math> and an interpretation of the fórmulas <math>\phi</math> of <math>\mu</math>-calculus, <math>[\![\underline{~\,}]\!]_i : \phi \rightarrow 2^S </math>, is the function definded by the following rules: | |||
* <math>[\![p]\!]_i = V(p)</math>; | |||
* <math>[\![\phi \wedge \psi]\!]_i = [\![\phi]\!]_i \cap [\![\psi]\!]_i</math>; | |||
* <math>[\![\neg \phi]\!]_i = S \smallsetminus [\![\phi]\!]_i</math>; | |||
* <math>[\![[a] \phi]\!]_i = \{s \in S \mid \forall t \in S, (s, t) \in R_a \rightarrow t \in [\![\phi]\!]_i\}</math>; | |||
* <math>[\![\nu Z. \phi]\!]_i = \bigcup \{T \subseteq S \mid T \subseteq [\![\phi]\!]_{i[Z := T]}\}</math>, where <math>i[Z := T]</math> maps Z to T while preserving the mappings of <math>i</math> everywhere else. | |||
By duality, the interpretation of the other basic formulas is: | |||
* <math>[\![\phi \vee \psi]\!]_i = [\![\phi]\!]_i \cup [\![\psi]\!]_i</math>; | |||
* <math>[\![\langle a \rangle \phi]\!]_i = \{s \in S \mid \exists t \in S, (s, t) \in R_a \wedge t \in [\![\phi]\!]_i\}</math>; | |||
* <math>[\![\mu Z. \phi]\!]_i = \bigcap \{T \subseteq S \mid [\![\phi]\!]_{i[Z := T]} \subseteq T \}</math> | |||
Less formally, this means that, for a given transition system <math>(S, R, V)</math>: | |||
* <math>p</math> holds in the set of states <math>V(p)</math>; | |||
* <math>\phi \wedge \psi</math> holds in every state where <math>\phi</math> and <math>\psi</math> both hold; | |||
* <math>\neg \phi</math> holds in every state where <math>\phi</math> does not hold. | |||
* <math>[a] \phi</math> holds in a state <math>s</math> if every <math>a</math>-transition leading out of <math>s</math> leads to a state where <math>\phi</math> holds. | |||
* <math>\langle a\rangle \phi</math> holds in a state <math>s</math> if there exists <math>a</math>-transition leading out of <math>s</math> that leads to a state where <math>\phi</math> holds. | |||
* <math>\nu Z.\phi</math> holds in any state in any set <math>T</math> such that, when the variable <math>Z</math> is set to <math>T</math>, then <math>\phi</math> holds for all of <math>T</math>. (From the [[Knaster–Tarski theorem]] it follows that <math>[\![\nu Z.\phi]\!]_i</math> is the greatest [[fixpoint]] of <math>[\![\phi]\!]_{i[Z := T]}</math>, and <math>[\![\mu Z. \phi]\!]_i</math> its least fixpoint.) | |||
The interpretations of <math>[a] \phi</math> and <math>\langle a\rangle \phi</math> are if fact the "classical" ones from [[Dynamic logic (modal logic)|dynamic logic]]. Additionally, the operator μ can be interpreted as [[liveness]] ("something good eventually happens") and ν as [[safety (computer science)|safety]] ("nothing bad ever happens") in [[Leslie Lamport]]'s informal classification.<ref name="Bradfield and Stirling, p. 731">Bradfield and Stirling, p. 731</ref> | |||
=== Examples === | |||
* <math>\nu Z.\phi \wedge [a]Z</math> is interpreted as "<math>\phi</math> is true along every ''a''-path".<ref name="Bradfield and Stirling, p. 731"/> | |||
* <math>\mu Z.\phi \vee \langle a \rangle Z</math> is interpreted as the existence of a path along ''a''-transitions to a state where <math>\phi</math> holds.<ref name="GrädelKolaitis2007"/> | |||
* The property of a system of being [[deadlock]]-free, understood as having no states without outgoing transitions and furthermore there does not exists a path to such a state, is expressed by formula<ref name="GrädelKolaitis2007">{{cite book|author1=Erich Grädel|author2=Phokion G. Kolaitis|author3=Leonid Libkin|coauthors=Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein|title=Finite Model Theory and Its Applications|url=http://books.google.com/books?id=e6ST-AVC27AC&pg=PA159|year=2007|publisher=Springer|isbn=978-3-540-00428-8|page=159}}</ref> | |||
*: <math>\nu Z.(\bigvee_{a\in A}\langle a\rangle\top\wedge \bigwedge_{a\in A}[a]Z)</math> | |||
==Satisfiability== | |||
[[Satisfiability]] of a modal μ-calculus formula is [[EXPTIME-complete]].<ref name="Schneider2004">{{cite book|author=Klaus Schneider|title=Verification of reactive systems: formal methods and algorithms|url=http://books.google.com/books?id=Z92bL1VrD_sC&pg=PA521|year=2004|publisher=Springer|isbn=978-3-540-00296-3|page=521}}</ref> | |||
== See also == | |||
* [[Finite model theory]] | |||
* [[Alternation-free modal μ-calculus]] | |||
==Notes== | |||
<references/> | |||
==References== | |||
*{{cite book | |||
| last = Clarke, Jr. | |||
| first = Edmund M. | |||
| coauthors = Orna Grumberg, Doron A. Peled | |||
| title = Model Checking | |||
| year = 1999 | |||
| publisher = MIT press | |||
| location = Cambridge, Massachusetts, USA | |||
| isbn = 0-262-03270-8 | |||
}}, chapter 7, Model checking for the μ-calculus, pp. 97–108 | |||
*{{cite book | |||
| last = Stirling | |||
| first = Colin. | |||
| title = Modal and Temporal Properties of Processes | |||
| year = 2001 | |||
| publisher = Springer Verlag | |||
| location = New York, Berlin, Heidelberg | |||
| isbn = 0-387-98717-7 | |||
}}, chapter 5, Modal μ-calculus, pp. 103–128 | |||
* {{cite book|author1=André Arnold|author2=Damian Niwiński|title=Rudiments of μ-Calculus|year=2001|publisher=Elsevier|isbn=978-0-444-50620-7}}, chapter 6, The μ-calculus over powerset algebras, pp. 141–153 is about the modal μ-calculus | |||
* Yde Venema (2008) [http://philo.ruc.edu.cn/logic/reading/Yde/mu0612.pdf Lectures on the Modal μ-calculus]; was presented at The 18th European Summer School in Logic, Language and Information | |||
*{{cite book | |||
| author = Bradfield, Julian and Stirling, Colin | |||
| year = 2006 | |||
| chapter = Modal mu-calculi | |||
| title = The Handbook of Modal Logic | |||
| editor = P. Blackburn, J. van Benthem and F. Wolter (eds.) | |||
| publisher = [[Elsevier]] | |||
| pages = 721–756 | |||
| url = http://homepages.inf.ed.ac.uk/jcb/Research/pubs.html#mlh-chapter | |||
}} | |||
*{{cite conference | |||
| first = E. Allen | |||
| last = Emerson | |||
| title = Model Checking and the Mu-calculus | |||
| booktitle = Descriptive Complexity and Finite Models | |||
| year = 1996 | |||
| pages = 185–214 | |||
| publisher = [[American Mathematical Society]] | |||
| isbn = 0-8218-0517-7 | |||
}} | |||
*{{cite journal | |||
| author = Kozen, Dexter | |||
| year = 1983 | |||
| title = Results on the Propositional μ-Calculus | |||
| journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]] | |||
| volume = 27 | |||
| issue = 3 | |||
| pages = 333–354 | |||
| doi = 10.1016/0304-3975(82)90125-6 | |||
}} | |||
== External links == | |||
* Sophie Pinchinat, [http://videolectures.net/ssll09_pinchinat_lag/ Logic, Automata & Games] video recording of a lecture at ANU Logic Summer School '09 | |||
[[Category:Modal logic]] | |||
[[Category:Model checking]] |
Revision as of 01:23, 5 April 2013
In theoretical computer science, the modal μ-calculus (Lμ, Lμ, sometimes just μ-calculus, although this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint operator , thus a fixed-point logic.
The (propositional, modal) μ-calculus originates with Dana Scott and Jaco de Bakker,[1] and was further developed by Dexter Kozen into the version most used nowadays. It is used to describe properties of labelled transition systems and for verifying these properties. Many temporal logics can be encoded in the μ-calculus, including CTL* and its widely used fragments—linear temporal logic and computational tree logic.[2]
An algebraic view is to see it as an algebra of monotonic functions over a complete lattice, with operators consisting of functional composition plus the least and greatest fixed point operators; from this viewpoint, the modal μ-calculus is over the lattice of a power set algebra.[3] The game semantics of μ-calculus is related to two-player games with perfect information, particularly infinite parity games.[4]
Syntax
Let P (propositions) and A (actions) be two finite sets of symbols, and let V be a countably infinite set of variables. The set of formulas of (propositional, modal) μ-calculus is defined as follows:
- each proposition and each variable is a formula;
- if and are formulas, then is a formula.
- if is a formula, then is a formula;
- if is a formula and is an action, then is a formula;(pronounced either: box or after necessarily )
- if is a formula and a variable, then is a formula, provided that every free occurrence of in occurs positively, i.e. within the scope of an even number of negations.
(The notions of free and bound variables are as usual, where is the only binding operator.)
Given the above definitions, we can enrich the syntax with:
- meaning
- (pronounced either: diamond or after possibly ) meaning
- means , where means substituting for Z in all free occurrences of Z in .
The first two formulas are the familiar ones from the classical propositional calculus and respectively the minimal multimodal logic K.
The notation (and its dual) are inspired from the lambda calculus; the intent is to denote the least (and respectively greatest) fixed point of the expression where the "minimization" (and respectively "maximization") are in the variable Z, much like in lambda calculus is a function with formula in bound variable Z;[5] see the denotational semantics below for details.
Denotational semantics
Models of (propositional) μ-calculus is given are labelled transition systems where:
- is a set of states;
- maps to each label a relation on ;
- , maps to each proposition the set of states where the proposition is true.
Given a labelled transition system and an interpretation of the fórmulas of -calculus, , is the function definded by the following rules:
By duality, the interpretation of the other basic formulas is:
Less formally, this means that, for a given transition system :
- holds in the set of states ;
- holds in every state where and both hold;
- holds in every state where does not hold.
- holds in a state if every -transition leading out of leads to a state where holds.
- holds in a state if there exists -transition leading out of that leads to a state where holds.
- holds in any state in any set such that, when the variable is set to , then holds for all of . (From the Knaster–Tarski theorem it follows that is the greatest fixpoint of , and its least fixpoint.)
The interpretations of and are if fact the "classical" ones from dynamic logic. Additionally, the operator μ can be interpreted as liveness ("something good eventually happens") and ν as safety ("nothing bad ever happens") in Leslie Lamport's informal classification.[6]
Examples
- is interpreted as " is true along every a-path".[6]
- is interpreted as the existence of a path along a-transitions to a state where holds.[7]
- The property of a system of being deadlock-free, understood as having no states without outgoing transitions and furthermore there does not exists a path to such a state, is expressed by formula[7]
Satisfiability
Satisfiability of a modal μ-calculus formula is EXPTIME-complete.[8]
See also
Notes
- ↑ Kozen p. 333.
- ↑ Clarke p.108, Theorem 6; Emerson p. 196
- ↑ Arnold and Niwiński, pp. viii-x and chapter 6
- ↑ Arnold and Niwiński, pp. viii-x and chapter 4
- ↑ Arnold and Niwiński, p. 14
- ↑ 6.0 6.1 Bradfield and Stirling, p. 731
- ↑ 7.0 7.1 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534, chapter 7, Model checking for the μ-calculus, pp. 97–108 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534, chapter 5, Modal μ-calculus, pp. 103–128 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534, chapter 6, The μ-calculus over powerset algebras, pp. 141–153 is about the modal μ-calculus - Yde Venema (2008) Lectures on the Modal μ-calculus; was presented at The 18th European Summer School in Logic, Language and Information
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 55 years old Systems Administrator Antony from Clarence Creek, really loves learning, PC Software and aerobics. Likes to travel and was inspired after making a journey to Historic Ensemble of the Potala Palace.
You can view that web-site... ccleaner free download - One of the biggest reasons investing in a Singapore new launch is an effective things is as a result of it is doable to be lent massive quantities of money at very low interest rates that you should utilize to purchase it. Then, if property values continue to go up, then you'll get a really high return on funding (ROI). Simply make sure you purchase one of the higher properties, reminiscent of the ones at Fernvale the Riverbank or any Singapore landed property Get Earnings by means of Renting
In its statement, the singapore property listing - website link, government claimed that the majority citizens buying their first residence won't be hurt by the new measures. Some concessions can even be prolonged to chose teams of consumers, similar to married couples with a minimum of one Singaporean partner who are purchasing their second property so long as they intend to promote their first residential property. Lower the LTV limit on housing loans granted by monetary establishments regulated by MAS from 70% to 60% for property purchasers who are individuals with a number of outstanding housing loans on the time of the brand new housing purchase. Singapore Property Measures - 30 August 2010 The most popular seek for the number of bedrooms in Singapore is 4, followed by 2 and three. Lush Acres EC @ Sengkang
Discover out more about real estate funding in the area, together with info on international funding incentives and property possession. Many Singaporeans have been investing in property across the causeway in recent years, attracted by comparatively low prices. However, those who need to exit their investments quickly are likely to face significant challenges when trying to sell their property – and could finally be stuck with a property they can't sell. Career improvement programmes, in-house valuation, auctions and administrative help, venture advertising and marketing, skilled talks and traisning are continuously planned for the sales associates to help them obtain better outcomes for his or her shoppers while at Knight Frank Singapore. No change Present Rules
Extending the tax exemption would help. The exemption, which may be as a lot as $2 million per family, covers individuals who negotiate a principal reduction on their existing mortgage, sell their house short (i.e., for lower than the excellent loans), or take part in a foreclosure course of. An extension of theexemption would seem like a common-sense means to assist stabilize the housing market, but the political turmoil around the fiscal-cliff negotiations means widespread sense could not win out. Home Minority Chief Nancy Pelosi (D-Calif.) believes that the mortgage relief provision will be on the table during the grand-cut price talks, in response to communications director Nadeam Elshami. Buying or promoting of blue mild bulbs is unlawful.
A vendor's stamp duty has been launched on industrial property for the primary time, at rates ranging from 5 per cent to 15 per cent. The Authorities might be trying to reassure the market that they aren't in opposition to foreigners and PRs investing in Singapore's property market. They imposed these measures because of extenuating components available in the market." The sale of new dual-key EC models will even be restricted to multi-generational households only. The models have two separate entrances, permitting grandparents, for example, to dwell separately. The vendor's stamp obligation takes effect right this moment and applies to industrial property and plots which might be offered inside three years of the date of buy. JLL named Best Performing Property Brand for second year running
The data offered is for normal info purposes only and isn't supposed to be personalised investment or monetary advice. Motley Fool Singapore contributor Stanley Lim would not personal shares in any corporations talked about. Singapore private home costs increased by 1.eight% within the fourth quarter of 2012, up from 0.6% within the earlier quarter. Resale prices of government-built HDB residences which are usually bought by Singaporeans, elevated by 2.5%, quarter on quarter, the quickest acquire in five quarters. And industrial property, prices are actually double the levels of three years ago. No withholding tax in the event you sell your property. All your local information regarding vital HDB policies, condominium launches, land growth, commercial property and more
There are various methods to go about discovering the precise property. Some local newspapers (together with the Straits Instances ) have categorised property sections and many local property brokers have websites. Now there are some specifics to consider when buying a 'new launch' rental. Intended use of the unit Every sale begins with 10 p.c low cost for finish of season sale; changes to 20 % discount storewide; follows by additional reduction of fiftyand ends with last discount of 70 % or extra. Typically there is even a warehouse sale or transferring out sale with huge mark-down of costs for stock clearance. Deborah Regulation from Expat Realtor shares her property market update, plus prime rental residences and houses at the moment available to lease Esparina EC @ Sengkang
External links
- Sophie Pinchinat, Logic, Automata & Games video recording of a lecture at ANU Logic Summer School '09