Independence-friendly logic :: a game-theoretic approach /
Bringing together over twenty years of research, this book gives a complete overview of independence-friendly logic. It emphasizes the game-theoretical approach to logic, according to which logical concepts such as truth and falsity are best understood via the notion of semantic games. The book push...
Gespeichert in:
1. Verfasser: | |
---|---|
Weitere Verfasser: | , |
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
Schriftenreihe: | London Mathematical Society lecture note series ;
386. |
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | Bringing together over twenty years of research, this book gives a complete overview of independence-friendly logic. It emphasizes the game-theoretical approach to logic, according to which logical concepts such as truth and falsity are best understood via the notion of semantic games. The book pushes the paradigm of game-theoretical semantics further than the current literature by showing how mixed strategies and equilibria can be used to analyze independence-friendly formulas on finite models. The book is suitable for graduate students and advanced undergraduates who have taken a course on first-order logic. It contains a primer of the necessary background in game theory, numerous examples and full proofs. |
Beschreibung: | 1 online resource (vi, 208 pages) |
Bibliographie: | Includes bibliographical references (pages 198-202) and index. |
ISBN: | 9781139077989 1139077988 9781139080279 113908027X 9780511981418 0511981414 1107213398 9781107213395 1283112531 9781283112536 1139075721 9781139075725 9786613112538 6613112534 1139082558 9781139082556 1139069969 9781139069960 |
Internformat
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | ZDB-4-EBA-ocn728157655 | ||
003 | OCoLC | ||
005 | 20241004212047.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 110602s2011 enk ob 001 0 eng d | ||
040 | |a N$T |b eng |e pn |c N$T |d E7B |d OUN |d OCLCQ |d REDDC |d OCLCQ |d DEBSZ |d OCLCQ |d YDXCP |d OCLCO |d AUD |d OCLCF |d OCLCQ |d CNCGM |d UAB |d OCLCQ |d INT |d OCLCQ |d AU@ |d OCLCQ |d S8J |d LUN |d OCLCQ |d OCLCO |d OCLCQ |d UKAHL |d QGK |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
015 | |a GBB0E2199 |2 bnb | ||
019 | |a 776973738 |a 855729299 |a 1090363811 |a 1167608727 |a 1259113592 | ||
020 | |a 9781139077989 |q (electronic bk.) | ||
020 | |a 1139077988 |q (electronic bk.) | ||
020 | |a 9781139080279 | ||
020 | |a 113908027X | ||
020 | |a 9780511981418 |q (ebook) | ||
020 | |a 0511981414 |q (ebook) | ||
020 | |z 9780521149341 | ||
020 | |z 0521149347 | ||
020 | |a 1107213398 | ||
020 | |a 9781107213395 | ||
020 | |a 1283112531 | ||
020 | |a 9781283112536 | ||
020 | |a 1139075721 | ||
020 | |a 9781139075725 | ||
020 | |a 9786613112538 | ||
020 | |a 6613112534 | ||
020 | |a 1139082558 | ||
020 | |a 9781139082556 | ||
020 | |a 1139069969 | ||
020 | |a 9781139069960 | ||
035 | |a (OCoLC)728157655 |z (OCoLC)776973738 |z (OCoLC)855729299 |z (OCoLC)1090363811 |z (OCoLC)1167608727 |z (OCoLC)1259113592 | ||
050 | 4 | |a BC128 |b .M36 2011eb | |
072 | 7 | |a MAT |x 016000 |2 bisacsh | |
072 | 7 | |a MAT |x 018000 |2 bisacsh | |
082 | 7 | |a 511.3 |2 22 | |
049 | |a MAIN | ||
100 | 1 | |a Mann, Allen L. |q (Allen Lawrence) |1 https://id.oclc.org/worldcat/entity/E39PCjwWQTT3xQJJpCD6vYjWtC |0 http://id.loc.gov/authorities/names/no2011095621 | |
245 | 1 | 0 | |a Independence-friendly logic : |b a game-theoretic approach / |c Allen L. Mann, Gabriel Sandu, Merlijn Sevenster. |
246 | 1 | 4 | |a Combinatorics, geometry and probability |
260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2011. | ||
300 | |a 1 online resource (vi, 208 pages) | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
490 | 1 | |a London Mathematical Society lecture note series ; |v 386 | |
504 | |a Includes bibliographical references (pages 198-202) and index. | ||
588 | 0 | |a Print version record. | |
505 | 0 | 0 | |g Machine generated contents note: |g 1. |t Introduction -- |g 2. |t Game theory -- |g 2.1. |t Extensive games -- |g 2.2. |t Strategic games -- |g 3. |t First-order logic -- |g 3.1. |t Syntax -- |g 3.2. |t Models -- |g 3.3. |t Game-theoretic semantics -- |g 3.4. |t Logical equivalence -- |g 3.5. |t Compositional semantics -- |g 3.6. |t Satisfiability -- |g 4. |t Independence-friendly logic -- |g 4.1. |t Syntax -- |g 4.2. |t Game-theoretic semantics -- |g 4.3. |t Skolem semantics -- |g 4.4. |t Compositional semantics -- |g 4.5. |t Game-theoretic semantics redux -- |g 5. |t Properties of IF logic -- |g 5.1. |t Basic properties -- |g 5.2. |t Extensions of IF logic -- |g 5.3. |t Logical equivalence -- |g 5.4. |t Model theory -- |g 6. |t Expressive power of IF logic -- |g 6.1. |t Definability -- |g 6.2. |t Second-order logic -- |g 6.3. |t Existential second-order logic -- |g 6.4. |t Perfect recall -- |g 7. |t Probabilistic IF logic -- |g 7.1. |t Equilibrium semantics -- |g 7.2. |t Monotonicity rules -- |g 7.3. |t Behavioral strategies and compositional semantics -- |g 7.4. |t Elimination of strategies -- |g 7.5. |t Expressing the rationals -- |g 8. |t Further topics -- |g 8.1. |t Compositionality -- |g 8.2. |t IF modal logic. |
520 | |a Bringing together over twenty years of research, this book gives a complete overview of independence-friendly logic. It emphasizes the game-theoretical approach to logic, according to which logical concepts such as truth and falsity are best understood via the notion of semantic games. The book pushes the paradigm of game-theoretical semantics further than the current literature by showing how mixed strategies and equilibria can be used to analyze independence-friendly formulas on finite models. The book is suitable for graduate students and advanced undergraduates who have taken a course on first-order logic. It contains a primer of the necessary background in game theory, numerous examples and full proofs. | ||
546 | |a English. | ||
650 | 0 | |a First-order logic. |0 http://id.loc.gov/authorities/subjects/sh85048595 | |
650 | 0 | |a Game theory. |0 http://id.loc.gov/authorities/subjects/sh85052941 | |
650 | 2 | |a Game Theory |0 https://id.nlm.nih.gov/mesh/D005716 | |
650 | 6 | |a Logique du premier ordre. | |
650 | 6 | |a Théorie des jeux. | |
650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
650 | 7 | |a First-order logic |2 fast | |
650 | 7 | |a Game theory |2 fast | |
700 | 1 | |a Sandu, Gabriel. |0 http://id.loc.gov/authorities/names/n89116848 | |
700 | 1 | |a Sevenster, Merlijn. |0 http://id.loc.gov/authorities/names/no2011095626 | |
758 | |i has work: |a Independence-friendly logic (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFYB8bTWQhJf8Wj79FTrbd |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
776 | 0 | 8 | |i Print version: |t Combinatorics, Geometry and Probability. |d Cambridge Univ Pr 2011 |z 9780521149341 |w (OCoLC)694393901 |
830 | 0 | |a London Mathematical Society lecture note series ; |v 386. |0 http://id.loc.gov/authorities/names/n42015587 | |
856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366121 |3 Volltext |
938 | |a Askews and Holts Library Services |b ASKH |n AH13438658 | ||
938 | |a ebrary |b EBRY |n ebr10469106 | ||
938 | |a EBSCOhost |b EBSC |n 366121 | ||
938 | |a YBP Library Services |b YANK |n 5690236 | ||
938 | |a YBP Library Services |b YANK |n 6300876 | ||
938 | |a YBP Library Services |b YANK |n 6918200 | ||
938 | |a YBP Library Services |b YANK |n 6943981 | ||
994 | |a 92 |b GEBAY | ||
912 | |a ZDB-4-EBA | ||
049 | |a DE-863 |
Datensatz im Suchindex
DE-BY-FWS_katkey | ZDB-4-EBA-ocn728157655 |
---|---|
_version_ | 1816881760752893952 |
adam_text | |
any_adam_object | |
author | Mann, Allen L. (Allen Lawrence) |
author2 | Sandu, Gabriel Sevenster, Merlijn |
author2_role | |
author2_variant | g s gs m s ms |
author_GND | http://id.loc.gov/authorities/names/no2011095621 http://id.loc.gov/authorities/names/n89116848 http://id.loc.gov/authorities/names/no2011095626 |
author_facet | Mann, Allen L. (Allen Lawrence) Sandu, Gabriel Sevenster, Merlijn |
author_role | |
author_sort | Mann, Allen L. |
author_variant | a l m al alm |
building | Verbundindex |
bvnumber | localFWS |
callnumber-first | B - Philosophy, Psychology, Religion |
callnumber-label | BC128 |
callnumber-raw | BC128 .M36 2011eb |
callnumber-search | BC128 .M36 2011eb |
callnumber-sort | BC 3128 M36 42011EB |
callnumber-subject | BC - Logic |
collection | ZDB-4-EBA |
contents | Introduction -- Game theory -- Extensive games -- Strategic games -- First-order logic -- Syntax -- Models -- Game-theoretic semantics -- Logical equivalence -- Compositional semantics -- Satisfiability -- Independence-friendly logic -- Skolem semantics -- Game-theoretic semantics redux -- Properties of IF logic -- Basic properties -- Extensions of IF logic -- Model theory -- Expressive power of IF logic -- Definability -- Second-order logic -- Existential second-order logic -- Perfect recall -- Probabilistic IF logic -- Equilibrium semantics -- Monotonicity rules -- Behavioral strategies and compositional semantics -- Elimination of strategies -- Expressing the rationals -- Further topics -- Compositionality -- IF modal logic. |
ctrlnum | (OCoLC)728157655 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05654cam a2200889 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn728157655</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">110602s2011 enk ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">OUN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCO</subfield><subfield code="d">AUD</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CNCGM</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INT</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">S8J</subfield><subfield code="d">LUN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBB0E2199</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">776973738</subfield><subfield code="a">855729299</subfield><subfield code="a">1090363811</subfield><subfield code="a">1167608727</subfield><subfield code="a">1259113592</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139077989</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139077988</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139080279</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">113908027X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511981418</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511981414</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521149341</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521149347</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107213398</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107213395</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283112531</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283112536</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139075721</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139075725</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613112538</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6613112534</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139082558</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139082556</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139069969</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139069960</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)728157655</subfield><subfield code="z">(OCoLC)776973738</subfield><subfield code="z">(OCoLC)855729299</subfield><subfield code="z">(OCoLC)1090363811</subfield><subfield code="z">(OCoLC)1167608727</subfield><subfield code="z">(OCoLC)1259113592</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">BC128</subfield><subfield code="b">.M36 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">016000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mann, Allen L.</subfield><subfield code="q">(Allen Lawrence)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjwWQTT3xQJJpCD6vYjWtC</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2011095621</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Independence-friendly logic :</subfield><subfield code="b">a game-theoretic approach /</subfield><subfield code="c">Allen L. Mann, Gabriel Sandu, Merlijn Sevenster.</subfield></datafield><datafield tag="246" ind1="1" ind2="4"><subfield code="a">Combinatorics, geometry and probability</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (vi, 208 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">386</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 198-202) and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="g">Machine generated contents note:</subfield><subfield code="g">1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">2.</subfield><subfield code="t">Game theory --</subfield><subfield code="g">2.1.</subfield><subfield code="t">Extensive games --</subfield><subfield code="g">2.2.</subfield><subfield code="t">Strategic games --</subfield><subfield code="g">3.</subfield><subfield code="t">First-order logic --</subfield><subfield code="g">3.1.</subfield><subfield code="t">Syntax --</subfield><subfield code="g">3.2.</subfield><subfield code="t">Models --</subfield><subfield code="g">3.3.</subfield><subfield code="t">Game-theoretic semantics --</subfield><subfield code="g">3.4.</subfield><subfield code="t">Logical equivalence --</subfield><subfield code="g">3.5.</subfield><subfield code="t">Compositional semantics --</subfield><subfield code="g">3.6.</subfield><subfield code="t">Satisfiability --</subfield><subfield code="g">4.</subfield><subfield code="t">Independence-friendly logic --</subfield><subfield code="g">4.1.</subfield><subfield code="t">Syntax --</subfield><subfield code="g">4.2.</subfield><subfield code="t">Game-theoretic semantics --</subfield><subfield code="g">4.3.</subfield><subfield code="t">Skolem semantics --</subfield><subfield code="g">4.4.</subfield><subfield code="t">Compositional semantics --</subfield><subfield code="g">4.5.</subfield><subfield code="t">Game-theoretic semantics redux --</subfield><subfield code="g">5.</subfield><subfield code="t">Properties of IF logic --</subfield><subfield code="g">5.1.</subfield><subfield code="t">Basic properties --</subfield><subfield code="g">5.2.</subfield><subfield code="t">Extensions of IF logic --</subfield><subfield code="g">5.3.</subfield><subfield code="t">Logical equivalence --</subfield><subfield code="g">5.4.</subfield><subfield code="t">Model theory --</subfield><subfield code="g">6.</subfield><subfield code="t">Expressive power of IF logic --</subfield><subfield code="g">6.1.</subfield><subfield code="t">Definability --</subfield><subfield code="g">6.2.</subfield><subfield code="t">Second-order logic --</subfield><subfield code="g">6.3.</subfield><subfield code="t">Existential second-order logic --</subfield><subfield code="g">6.4.</subfield><subfield code="t">Perfect recall --</subfield><subfield code="g">7.</subfield><subfield code="t">Probabilistic IF logic --</subfield><subfield code="g">7.1.</subfield><subfield code="t">Equilibrium semantics --</subfield><subfield code="g">7.2.</subfield><subfield code="t">Monotonicity rules --</subfield><subfield code="g">7.3.</subfield><subfield code="t">Behavioral strategies and compositional semantics --</subfield><subfield code="g">7.4.</subfield><subfield code="t">Elimination of strategies --</subfield><subfield code="g">7.5.</subfield><subfield code="t">Expressing the rationals --</subfield><subfield code="g">8.</subfield><subfield code="t">Further topics --</subfield><subfield code="g">8.1.</subfield><subfield code="t">Compositionality --</subfield><subfield code="g">8.2.</subfield><subfield code="t">IF modal logic.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Bringing together over twenty years of research, this book gives a complete overview of independence-friendly logic. It emphasizes the game-theoretical approach to logic, according to which logical concepts such as truth and falsity are best understood via the notion of semantic games. The book pushes the paradigm of game-theoretical semantics further than the current literature by showing how mixed strategies and equilibria can be used to analyze independence-friendly formulas on finite models. The book is suitable for graduate students and advanced undergraduates who have taken a course on first-order logic. It contains a primer of the necessary background in game theory, numerous examples and full proofs.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">First-order logic.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85048595</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Game theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85052941</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Game Theory</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D005716</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Logique du premier ordre.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des jeux.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Infinity.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Logic.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">First-order logic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Game theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sandu, Gabriel.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n89116848</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sevenster, Merlijn.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2011095626</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Independence-friendly logic (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFYB8bTWQhJf8Wj79FTrbd</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Combinatorics, Geometry and Probability.</subfield><subfield code="d">Cambridge Univ Pr 2011</subfield><subfield code="z">9780521149341</subfield><subfield code="w">(OCoLC)694393901</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">386.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42015587</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366121</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH13438658</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10469106</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">366121</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">5690236</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6300876</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6918200</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6943981</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
id | ZDB-4-EBA-ocn728157655 |
illustrated | Not Illustrated |
indexdate | 2024-11-27T13:17:51Z |
institution | BVB |
isbn | 9781139077989 1139077988 9781139080279 113908027X 9780511981418 0511981414 1107213398 9781107213395 1283112531 9781283112536 1139075721 9781139075725 9786613112538 6613112534 1139082558 9781139082556 1139069969 9781139069960 |
language | English |
oclc_num | 728157655 |
open_access_boolean | |
owner | MAIN DE-863 DE-BY-FWS |
owner_facet | MAIN DE-863 DE-BY-FWS |
physical | 1 online resource (vi, 208 pages) |
psigel | ZDB-4-EBA |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Cambridge University Press, |
record_format | marc |
series | London Mathematical Society lecture note series ; |
series2 | London Mathematical Society lecture note series ; |
spelling | Mann, Allen L. (Allen Lawrence) https://id.oclc.org/worldcat/entity/E39PCjwWQTT3xQJJpCD6vYjWtC http://id.loc.gov/authorities/names/no2011095621 Independence-friendly logic : a game-theoretic approach / Allen L. Mann, Gabriel Sandu, Merlijn Sevenster. Combinatorics, geometry and probability Cambridge ; New York : Cambridge University Press, 2011. 1 online resource (vi, 208 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier London Mathematical Society lecture note series ; 386 Includes bibliographical references (pages 198-202) and index. Print version record. Machine generated contents note: 1. Introduction -- 2. Game theory -- 2.1. Extensive games -- 2.2. Strategic games -- 3. First-order logic -- 3.1. Syntax -- 3.2. Models -- 3.3. Game-theoretic semantics -- 3.4. Logical equivalence -- 3.5. Compositional semantics -- 3.6. Satisfiability -- 4. Independence-friendly logic -- 4.1. Syntax -- 4.2. Game-theoretic semantics -- 4.3. Skolem semantics -- 4.4. Compositional semantics -- 4.5. Game-theoretic semantics redux -- 5. Properties of IF logic -- 5.1. Basic properties -- 5.2. Extensions of IF logic -- 5.3. Logical equivalence -- 5.4. Model theory -- 6. Expressive power of IF logic -- 6.1. Definability -- 6.2. Second-order logic -- 6.3. Existential second-order logic -- 6.4. Perfect recall -- 7. Probabilistic IF logic -- 7.1. Equilibrium semantics -- 7.2. Monotonicity rules -- 7.3. Behavioral strategies and compositional semantics -- 7.4. Elimination of strategies -- 7.5. Expressing the rationals -- 8. Further topics -- 8.1. Compositionality -- 8.2. IF modal logic. Bringing together over twenty years of research, this book gives a complete overview of independence-friendly logic. It emphasizes the game-theoretical approach to logic, according to which logical concepts such as truth and falsity are best understood via the notion of semantic games. The book pushes the paradigm of game-theoretical semantics further than the current literature by showing how mixed strategies and equilibria can be used to analyze independence-friendly formulas on finite models. The book is suitable for graduate students and advanced undergraduates who have taken a course on first-order logic. It contains a primer of the necessary background in game theory, numerous examples and full proofs. English. First-order logic. http://id.loc.gov/authorities/subjects/sh85048595 Game theory. http://id.loc.gov/authorities/subjects/sh85052941 Game Theory https://id.nlm.nih.gov/mesh/D005716 Logique du premier ordre. Théorie des jeux. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh First-order logic fast Game theory fast Sandu, Gabriel. http://id.loc.gov/authorities/names/n89116848 Sevenster, Merlijn. http://id.loc.gov/authorities/names/no2011095626 has work: Independence-friendly logic (Text) https://id.oclc.org/worldcat/entity/E39PCFYB8bTWQhJf8Wj79FTrbd https://id.oclc.org/worldcat/ontology/hasWork Print version: Combinatorics, Geometry and Probability. Cambridge Univ Pr 2011 9780521149341 (OCoLC)694393901 London Mathematical Society lecture note series ; 386. http://id.loc.gov/authorities/names/n42015587 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366121 Volltext |
spellingShingle | Mann, Allen L. (Allen Lawrence) Independence-friendly logic : a game-theoretic approach / London Mathematical Society lecture note series ; Introduction -- Game theory -- Extensive games -- Strategic games -- First-order logic -- Syntax -- Models -- Game-theoretic semantics -- Logical equivalence -- Compositional semantics -- Satisfiability -- Independence-friendly logic -- Skolem semantics -- Game-theoretic semantics redux -- Properties of IF logic -- Basic properties -- Extensions of IF logic -- Model theory -- Expressive power of IF logic -- Definability -- Second-order logic -- Existential second-order logic -- Perfect recall -- Probabilistic IF logic -- Equilibrium semantics -- Monotonicity rules -- Behavioral strategies and compositional semantics -- Elimination of strategies -- Expressing the rationals -- Further topics -- Compositionality -- IF modal logic. First-order logic. http://id.loc.gov/authorities/subjects/sh85048595 Game theory. http://id.loc.gov/authorities/subjects/sh85052941 Game Theory https://id.nlm.nih.gov/mesh/D005716 Logique du premier ordre. Théorie des jeux. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh First-order logic fast Game theory fast |
subject_GND | http://id.loc.gov/authorities/subjects/sh85048595 http://id.loc.gov/authorities/subjects/sh85052941 https://id.nlm.nih.gov/mesh/D005716 |
title | Independence-friendly logic : a game-theoretic approach / |
title_alt | Combinatorics, geometry and probability Introduction -- Game theory -- Extensive games -- Strategic games -- First-order logic -- Syntax -- Models -- Game-theoretic semantics -- Logical equivalence -- Compositional semantics -- Satisfiability -- Independence-friendly logic -- Skolem semantics -- Game-theoretic semantics redux -- Properties of IF logic -- Basic properties -- Extensions of IF logic -- Model theory -- Expressive power of IF logic -- Definability -- Second-order logic -- Existential second-order logic -- Perfect recall -- Probabilistic IF logic -- Equilibrium semantics -- Monotonicity rules -- Behavioral strategies and compositional semantics -- Elimination of strategies -- Expressing the rationals -- Further topics -- Compositionality -- IF modal logic. |
title_auth | Independence-friendly logic : a game-theoretic approach / |
title_exact_search | Independence-friendly logic : a game-theoretic approach / |
title_full | Independence-friendly logic : a game-theoretic approach / Allen L. Mann, Gabriel Sandu, Merlijn Sevenster. |
title_fullStr | Independence-friendly logic : a game-theoretic approach / Allen L. Mann, Gabriel Sandu, Merlijn Sevenster. |
title_full_unstemmed | Independence-friendly logic : a game-theoretic approach / Allen L. Mann, Gabriel Sandu, Merlijn Sevenster. |
title_short | Independence-friendly logic : |
title_sort | independence friendly logic a game theoretic approach |
title_sub | a game-theoretic approach / |
topic | First-order logic. http://id.loc.gov/authorities/subjects/sh85048595 Game theory. http://id.loc.gov/authorities/subjects/sh85052941 Game Theory https://id.nlm.nih.gov/mesh/D005716 Logique du premier ordre. Théorie des jeux. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh First-order logic fast Game theory fast |
topic_facet | First-order logic. Game theory. Game Theory Logique du premier ordre. Théorie des jeux. MATHEMATICS Infinity. MATHEMATICS Logic. First-order logic Game theory |
url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366121 |
work_keys_str_mv | AT mannallenl independencefriendlylogicagametheoreticapproach AT sandugabriel independencefriendlylogicagametheoreticapproach AT sevenstermerlijn independencefriendlylogicagametheoreticapproach AT mannallenl combinatoricsgeometryandprobability AT sandugabriel combinatoricsgeometryandprobability AT sevenstermerlijn combinatoricsgeometryandprobability |