|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| '''Game semantics''' ({{lang-de|dialogische Logik}}, translated as ''dialogical logic'') is an approach to [[Formal semantics (logic)|formal semantics]] that grounds the concepts of [[truth]] or [[validity]] on [[game theory|game-theoretic]] concepts, such as the existence of a winning strategy for a player, somewhat resembling [[Socratic dialogues]] or medieval [[theory of Obligationes]]. In the late 1950s [[Paul Lorenzen]] was the first to introduce a game semantics for [[logic]], and it was further developed by Kuno Lorenz. At almost the same time as Lorenzen, [[Jaakko Hintikka]] developed a model-theoretical approach known in the literature as ''GTS''. Since then, a number of different game semantics have been studied in logic. Shahid Rahman (Lille) and collaborators developed ''dialogic'' into a general framework for the study of logical and philosophical issues related to logical pluralism. At around 1995 this triggered a kind of Renaissance with lasting consequences. Actually this new philosophical impulse experienced a parallel renewal in the fields of [[theoretical computer science]], [[computational linguistics]], [[artificial intelligence]] and the [[formal semantics of programming languages]] triggered by the work of [[Johan van Benthem (logician)|Johan van Benthem]] and collaborators in [[Amsterdam]] who looked thoroughly at the interface between logic and games. New results in [[linear logic]] by J-Y. Girard in the interfaces between mathematical game theory and [[logic]] on one hand and [[argumentation theory]] and logic on the other hand resulted in the work of many others, including [[Samson Abramsky|S. Abramsky]], J. van Benthem, [[Andreas Blass|A. Blass]], [[Dov Gabbay|D. Gabbay]], [[Martin Hyland|M. Hyland]], [[Wilfred Hodges|W. Hodges]], R. Jagadeesan, [[Giorgi Japaridze|G. Japaridze]], E. Krabbe, L. Ong, H. Prakken, G. Sandu D. Walton, and J. Woods who placed game semantics at the center of a new concept in logic in which logic is understood as a dynamic instrument of inference.
| | If your computer is running slow, you have possibly gone by the different stages of rage plus frustration. Having such a ideal tool like a computer may seem like a curse along with a blessing simultaneously whenever this occurs. It is excellent when it is actually running rapidly plus smooth, but then when it begins acting strange plus slows way down, frustration sets in. How could something as great because a computer create a individual so mad?<br><br>Your PC registry starts to get errors plus fragmented the more we employ the computer because we enter more information every time, in addition to create changes in the systems plus setup. When the registry starts to get overloaded and full of errors, the computer can eventually crash. It is possible to fix it on the own however, especially dangerous, particularly should you have no extensive experience inside doing this. Therefore, do NOT even attempt to do this oneself.<br><br>The Windows registry is a program database of information. Windows and alternative software shop a lot of settings and additional information inside it, plus retrieve such info within the registry all of the time. The registry is additionally a bottleneck in which because it is very the heart of the operating system, any issues with it will result mistakes and bring the operating system down.<br><br>If you feel we don't have enough income at the time to upgrade, then the greatest option is to free up certain area by deleting some of the unwanted files and folders.<br><br>The final step is to make sure that we clean the registry of the computer. The "registry" is a large database which stores significant files, settings & options, plus information. Windows reads the files it needs in order for it to run programs from this database. If the registry gets damaged, infected, or clogged up, then Windows are not able to correctly access the files it needs for it to load up programs. As this happens, issues plus errors like the d3d9.dll error happen. To fix this plus avoid future setbacks, we have to download plus run a registry cleaning tool. The highly recommended software is the "Frontline [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities]".<br><br>Windows relies heavily on this database, storing everything from the latest emails to a Internet favorites in there. Because it's thus crucial, your computer is consistently adding plus updating the files inside it. This really is fine, but it could make the computer run slow, when the computer accidentally breaks its crucial registry files. This really is a quite prevalent problem, plus really makes the computer run slower every day. What happens is the fact that since your computer is regularly using 100's of registry files at when, it often gets confused and make a few of them unreadable. This then makes your computer run slow, because Windows takes longer to read the files it demands.<br><br>Across the top of the scan results display page you see the tabs... Registry, Junk Files, Privacy, Bad Active X, Performance, etc. Every of these tabs might show we the results of that area. The Junk Files are mostly temporary files such as web data, images, web pages... And they are really taking up storage space.<br><br>A program and registry cleaner is downloaded from the internet. It's user friendly and the task refuses to take long. All it does is scan and then when it finds errors, it may fix and clean those errors. An error free registry may protect the computer from mistakes and provide you a slow PC fix. |
| | |
| ==Classical logic==
| |
| The simplest application of game semantics is to [[propositional logic]]. Each formula of this language is interpreted as a game between two players, known as the "Verifier" and the "Falsifier". The Verifier is given "ownership" of all the [[disjunction]]s in the formula, and the Falsifier is likewise given ownership of all the [[Logical conjunction|conjunctions]]. Each move of the game consists of allowing the owner of the dominant connective to pick one of its branches; play will then continue in that subformula, with whichever player controls its dominant connective making the next move. Play ends when a primitive proposition has been so chosen by the two players; at this point the Verifier is deemed the winner if the resulting proposition is true, and the Falsifier is deemed the winner if it is false. The original formula will be considered true precisely when the Verifier has a [[winning strategy]], while it will be false whenever the Falsifier has the winning strategy.
| |
| | |
| If the formula contains negations or implications, other, more complicated, techniques may be used. For example, a [[negation]] should be true if the thing negated is false, so it must have the effect of interchanging the roles of the two players. | |
| | |
| More generally, game semantics may be applied to [[predicate logic]]; the new rules allow a dominant [[quantifier]] to be removed by its "owner" (the Verifier for [[existential quantifier]]s and the Falsifier for [[universal quantifier]]s) and its [[bound variable]] replaced at all occurrences by an object of the owner's choosing, drawn from the [[domain of quantification]]. Note that a single counterexample falsifies a universally quantified statement, and a single example suffices to verify an existentially quantified one. Assuming the [[axiom of choice]], the game-theoretical semantics for classical [[first-order logic]] agree with the usual [[First-order_logic#Semantics|model-based (Tarskian) semantics]]. For classical first-order logic the winning strategy for the verifier essentially consists of finding adequate [[Skolem function]]s and [[Witness (mathematics)|witnesses]]. For example, if ''S'' denotes <math>\forall x \exists y\, \phi(x,y)</math> then an [[equisatisfiable]] statement for ''S'' is <math>\exists f \forall x \, \phi(x,f(x))</math>. The Skolem function ''f'' (if it exists) actually codifies a winning strategy for the verifier of ''S'' by returning a witness for the existential sub-formula for every choice of ''x'' the falsifier might make.<ref>[[Jaakko Hintikka|J. Hintikka]] and G. Sandu, 2009, "Game-Theoretical Semantics" in Keith Allan (ed.) ''Concise Encyclopedia of Semantics'', Elsevier, ISBN 0-08095-968-7, pp. 341–343</ref>
| |
| | |
| Actually the formulation described above is due to Jaakko Hintikka's GTS-interpretation. The original version of classical (and intuitionistic) logic of Paul Lorenzen and Kuno Lorenz were not defined in relation to models but with the help of ''winning strategies'' over ''formal dialogues'' (P. Lorenzen, K. Lorenz 1978, S. Rahman and L. Keiff 2005). Shahid Rahman and Tero Tulenheimo developed an algorithm to transform GTS-winning strategies for classical logic into the dialogical winning strategies and vice-versa.
| |
| | |
| All of these games are of [[perfect information]]; the two players always know the [[truth value]]s of each primitive, and are aware of all preceding moves in the game.
| |
| | |
| == Intuitionistic logic, denotational semantics, linear logic, logical pluralism ==
| |
| The primary motivation for Lorenzen and Kuno Lorenz was to find a game-theoretic (their term was "dialogical" ''Dialogische Logik'') semantics for [[intuitionistic logic]]. [[Andreas Blass]]<ref>[http://www.math.lsa.umich.edu/~ablass/ Andreas R. Blass<!-- Bot generated title -->]</ref> was the first to point out connections between game semantics and [[linear logic]]. This line was further developed by [[Samson Abramsky]], [[Radhakrishnan Jagadeesan]], [[Pasquale Malacaria]] and independently [[Martin Hyland]] and [http://users.comlab.ox.ac.uk/luke.ong/ Luke Ong], who placed special emphasis on compositionality, i.e. the definition of strategies inductively on the syntax. Using game semantics, the authors mentioned above have solved the long-standing problem of defining a [[fully abstract]] model for the programming language [[Programming language for Computable Functions|PCF]]. Consequently, game semantics has led to fully abstract semantic models for a variety of programming languages and, to new semantic-directed methods of software verification by software [[model checking]].
| |
| | |
| Shahid Rahman and Helge Rückert extended the dialogical approach to the study of several non-classical logics such as modal logic, relevance logic, free logic and connexive logic. Recently, Rahman and collaborators developed the dialogical approach into a general framework aimed at the discussion of logical pluralism.<ref>http://stl.recherche.univ-lille3.fr/sitespersonnels/rahman/accueilrahman.html</ref>
| |
| | |
| == Quantifiers ==
| |
| Foundational considerations of game semantics have been more emphasised by [[Jaakko Hintikka]] and Gabriel Sandu, especially for [[Independence-friendly logic]] (IF logic, more recently ''Information''-friendly logic), a logic with [[branching quantifier]]s. It was thought that the [[principle of compositionality]] fails for these logics, so that a Tarskian [[truth definition]] could not provide a suitable semantics. To get around this problem, the quantifiers were given a game-theoretic meaning. Specifically, the approach is the same as in classical propositional logic, except that the players do not always have [[perfect information]] about previous moves by the other player. [[Wilfrid Hodges]] has proposed a [[compositional semantics]] and proved it equivalent to game semantics for IF-logics. Foundational considerations have motivated the works of others, such as [http://www.csc.villanova.edu/~japaridz/ Japaridze]'s [[computability logic]].
| |
| | |
| == See also ==
| |
| * [[Independence-friendly logic]]
| |
| * [[Dependence logic]]
| |
| * [[Intuitionistic logic]]
| |
| * [[Computability logic]]
| |
| * [[Interactive computation]]
| |
| * [[Ludics]]
| |
| | |
| == References ==
| |
| {{More footnotes|date=May 2010}}
| |
| {{Reflist}}
| |
| | |
| === Articles ===
| |
| * S. Abramsky and R.Jagadeesan, ''Games and full completeness for multiplicative linear logic''. Journal of Symbolic Logic 59 (1994): 543-574.
| |
| * A. Blass, ''A game semantics for linear logic''. Annals of Pure and Applied Logic 56 (1992): 151-166.
| |
| * D.R. Ghica, ''[http://doi.ieeecomputersociety.org/10.1109/LICS.2009.26 Applications of Game Semantics: From Program Analysis to Hardware Synthesis]''. 2009 24th Annual IEEE Symposium on Logic In Computer Science: 17-26. ISBN 978-0-7695-3746-7.
| |
| * G. Japaridze, ''Introduction to computability logic''. Annals of Pure and Applied Logic 123 (2003): 1-99.
| |
| * G. Japaridze, ''[http://arxiv.org/abs/cs.LO/0507045 In the beginning was game semantics]''. In Ondrej Majer, Ahti-Veikko Pietarinen and Tero Tulenheimo (editors), ''Games: Unifying logic, Language and Philosophy''. Springer (2009).
| |
| * Krabbe, E. C. W., 2001. "Dialogue Foundations: Dialogue Logic Restituted [title has been misprinted as "...Revisited"]," ''Supplement to the Proceedings of The Aristotelian Society 75'': 33-49.
| |
| * S. Rahman and L. Keiff, ''On how to be a dialogician''. In Daniel Vanderken (ed.), ''Logic Thought and Action'', Springer (2005), 359-408. ISBN 1-4020-2616-1.
| |
| * S. Rahman and T. Tulenheimo, ''From Games to Dialogues and Back: Towards a General Frame for Validity''. In Ondrej Majer, Ahti-Veikko Pietarinen and Tero Tulenheimo (editors), ''Games: Unifying logic, Language and Philosophy''. Springer (2009).
| |
| * {{cite book|editor=G. E. Mints|editor2=Reinhard Muskens|title=Games, logic, and constructive sets|year=2003|publisher=CSLI Publications|isbn=978-1-57586-449-5|author=Johan van Benthem|chapter=Logic and Game Theory: Close Encounters of the Third Kind }}
| |
| | |
| === Books ===
| |
| * T. Aho and A-V. Pietarinen (eds.) ''Truth and Games. Essays in honour of Gabriel Sandu''. Societas Philosophica Fennica (2006).ISBN 951-9264-57-4.
| |
| * J. van Benthem, G. Heinzmann, M. Rebuschi and H. Visser (eds.) ''The Age of Alternative Logics''. Springer (2006).ISBN 1-40-20-5011-4.
| |
| * R. Inhetveen: ''Logik. Eine dialog-orientierte Einführung.'', Leipzig 2003 ISBN 3-937219-02-1
| |
| * L. Keiff ''Le Pluralisme Dialogique''. Thesis Université de Lille 3 (2007).
| |
| * K. Lorenz, P. Lorenzen: ''Dialogische Logik'', Darmstadt 1978
| |
| * P. Lorenzen: ''Lehrbuch der konstruktiven Wissenschaftstheorie'', Stuttgart 2000 ISBN 3-476-01784-2
| |
| * O. Majer, A.-V. Pietarinen and T. Tulenheimo (editors). ''[http://www.springer.com/philosophy/logic/book/978-1-4020-9373-9 Games: Unifying Logic, Language and Philosophy]''. Springer (2009).
| |
| * S. Rahman, ''Über Dialogue protologische Kategorien und andere Seltenheiten''. Frankfurt 1993 ISBN 3-631-46583-1
| |
| * S. Rahman and H. Rückert (editors), ''New Perspectives in Dialogical Logic''. Synthese 127 (2001) ISSN 0039-7857.
| |
| * J. Redmond & M. Fontaine, How to play dialogues. An introduction to Dialogical Logic. London, College Publications (Col. Dialogues and the Games of Logic. A Philosophical Perspective N° 1). (ISBN 978-1-84890-046-2)
| |
| | |
| == External links ==
| |
| * [http://www.cis.upenn.edu/~giorgi/cl.html Computability Logic Homepage]
| |
| * [https://sites.google.com/site/galopws/ GALOP: Workshop on Games for Logic and Programming Languages]
| |
| * [http://www.csc.villanova.edu/~japaridz/CL/gsoll.html Game Semantics or Linear Logic?]
| |
| * [http://plato.stanford.edu/entries/logic-games/ Stanford Encyclopedia of Philosophy entry on Logic and Games]
| |
| * [http://plato.stanford.edu/entries/logic-dialogical/ SEP entry on Dialogical Logic]
| |
| | |
| [[Category:Logic in computer science]]
| |
| [[Category:Mathematical logic]]
| |
| [[Category:Philosophical logic]]
| |
| [[Category:Quantification]]
| |
| [[Category:Game theory]]
| |
If your computer is running slow, you have possibly gone by the different stages of rage plus frustration. Having such a ideal tool like a computer may seem like a curse along with a blessing simultaneously whenever this occurs. It is excellent when it is actually running rapidly plus smooth, but then when it begins acting strange plus slows way down, frustration sets in. How could something as great because a computer create a individual so mad?
Your PC registry starts to get errors plus fragmented the more we employ the computer because we enter more information every time, in addition to create changes in the systems plus setup. When the registry starts to get overloaded and full of errors, the computer can eventually crash. It is possible to fix it on the own however, especially dangerous, particularly should you have no extensive experience inside doing this. Therefore, do NOT even attempt to do this oneself.
The Windows registry is a program database of information. Windows and alternative software shop a lot of settings and additional information inside it, plus retrieve such info within the registry all of the time. The registry is additionally a bottleneck in which because it is very the heart of the operating system, any issues with it will result mistakes and bring the operating system down.
If you feel we don't have enough income at the time to upgrade, then the greatest option is to free up certain area by deleting some of the unwanted files and folders.
The final step is to make sure that we clean the registry of the computer. The "registry" is a large database which stores significant files, settings & options, plus information. Windows reads the files it needs in order for it to run programs from this database. If the registry gets damaged, infected, or clogged up, then Windows are not able to correctly access the files it needs for it to load up programs. As this happens, issues plus errors like the d3d9.dll error happen. To fix this plus avoid future setbacks, we have to download plus run a registry cleaning tool. The highly recommended software is the "Frontline tuneup utilities".
Windows relies heavily on this database, storing everything from the latest emails to a Internet favorites in there. Because it's thus crucial, your computer is consistently adding plus updating the files inside it. This really is fine, but it could make the computer run slow, when the computer accidentally breaks its crucial registry files. This really is a quite prevalent problem, plus really makes the computer run slower every day. What happens is the fact that since your computer is regularly using 100's of registry files at when, it often gets confused and make a few of them unreadable. This then makes your computer run slow, because Windows takes longer to read the files it demands.
Across the top of the scan results display page you see the tabs... Registry, Junk Files, Privacy, Bad Active X, Performance, etc. Every of these tabs might show we the results of that area. The Junk Files are mostly temporary files such as web data, images, web pages... And they are really taking up storage space.
A program and registry cleaner is downloaded from the internet. It's user friendly and the task refuses to take long. All it does is scan and then when it finds errors, it may fix and clean those errors. An error free registry may protect the computer from mistakes and provide you a slow PC fix.