Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Information dynamics and uniform substitution

Identifieur interne : 000062 ( PascalFrancis/Checkpoint ); précédent : 000061; suivant : 000063

Information dynamics and uniform substitution

Auteurs : Wesley H. Holliday [États-Unis] ; Tomohiro Hoshi [États-Unis] ; Thomas F. Iii Icard [États-Unis]

Source :

RBID : Francis:14-0052693

Descripteurs français

English descriptors

Abstract

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution.


Affiliations:


Links toward previous steps (curation, corpus...)


Links to Exploration step

Francis:14-0052693

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Information dynamics and uniform substitution</title>
<author>
<name sortKey="Holliday, Wesley H" sort="Holliday, Wesley H" uniqKey="Holliday W" first="Wesley H." last="Holliday">Wesley H. Holliday</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Hoshi, Tomohiro" sort="Hoshi, Tomohiro" uniqKey="Hoshi T" first="Tomohiro" last="Hoshi">Tomohiro Hoshi</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<inist:fA14 i1="02">
<s1>Stanford Pre-Collegiate Studies, Stanford University</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Icard, Thomas F Iii" sort="Icard, Thomas F Iii" uniqKey="Icard T" first="Thomas F. Iii" last="Icard">Thomas F. Iii Icard</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<inist:fA14 i1="03">
<s1>Department of Philosophy, Stanford University</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">14-0052693</idno>
<date when="2013">2013</date>
<idno type="stanalyst">FRANCIS 14-0052693 INIST</idno>
<idno type="RBID">Francis:14-0052693</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000045</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000971</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000062</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000062</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Information dynamics and uniform substitution</title>
<author>
<name sortKey="Holliday, Wesley H" sort="Holliday, Wesley H" uniqKey="Holliday W" first="Wesley H." last="Holliday">Wesley H. Holliday</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Hoshi, Tomohiro" sort="Hoshi, Tomohiro" uniqKey="Hoshi T" first="Tomohiro" last="Hoshi">Tomohiro Hoshi</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<inist:fA14 i1="02">
<s1>Stanford Pre-Collegiate Studies, Stanford University</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Icard, Thomas F Iii" sort="Icard, Thomas F Iii" uniqKey="Icard T" first="Thomas F. Iii" last="Icard">Thomas F. Iii Icard</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<inist:fA14 i1="03">
<s1>Department of Philosophy, Stanford University</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stanford, CA</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Synthese : (Dordrecht)</title>
<title level="j" type="abbreviated">Synthese : (Dordrecht)</title>
<idno type="ISSN">0039-7857</idno>
<imprint>
<date when="2013">2013</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Synthese : (Dordrecht)</title>
<title level="j" type="abbreviated">Synthese : (Dordrecht)</title>
<idno type="ISSN">0039-7857</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Knowledge theory</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Théorie de la connaissance</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0039-7857</s0>
</fA01>
<fA03 i2="1">
<s0>Synthese : (Dordrecht)</s0>
</fA03>
<fA05>
<s2>190</s2>
</fA05>
<fA06>
<s3>SUP1</s3>
</fA06>
<fA08 i1="01" i2="1" l="ENG">
<s1>Information dynamics and uniform substitution</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>THIRD INTERNATIONAL WORKSHOP ON LOGIC, RATIONALITY AND INTERACTION (LORI-III) IN GUANGZHOU</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>HOLLIDAY (Wesley H.)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>HOSHI (Tomohiro)</s1>
</fA11>
<fA11 i1="03" i2="1">
<s1>ICARD (Thomas F. III)</s1>
</fA11>
<fA12 i1="01" i2="1">
<s1>VAN DITMARSCH (Hans)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1">
<s1>LANG (Jérôme)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01">
<s1>Logical Dynamics Lab, Center for the Study of Language and Information</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>Stanford Pre-Collegiate Studies, Stanford University</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03">
<s1>Department of Philosophy, Stanford University</s1>
<s2>Stanford, CA</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA15 i1="01">
<s1>LORIA, CNRS - Université de Lorraine</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02">
<s1>LAMSADE, CNRS - Université Paris-Dauphine</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20>
<s1>31-55</s1>
</fA20>
<fA21>
<s1>2013</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA43 i1="01">
<s1>INIST</s1>
<s2>24852</s2>
<s5>354000505705560020</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2014 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>1 p.1/4</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>14-0052693</s0>
</fA47>
<fA60>
<s1>P</s1>
<s2>C</s2>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Synthese : (Dordrecht)</s0>
</fA64>
<fA66 i1="01">
<s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution.</s0>
</fC01>
<fC02 i1="01" i2="P">
<s0>51911</s0>
<s1>XI</s1>
</fC02>
<fC02 i1="02" i2="P">
<s0>519</s0>
</fC02>
<fC03 i1="01" i2="P" l="FRE">
<s0>Théorie de la connaissance</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="P" l="ENG">
<s0>Knowledge theory</s0>
<s5>01</s5>
</fC03>
<fN21>
<s1>062</s1>
</fN21>
<fN44 i1="01">
<s1>OTO</s1>
</fN44>
<fN82>
<s1>OTO</s1>
</fN82>
</pA>
<pR>
<fA30 i1="01" i2="1" l="ENG">
<s1>LORI-III International Workshop on Logic, Rationality, and Interaction</s1>
<s2>3</s2>
<s3>Guangzhou CHN</s3>
<s4>2011-10-10</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations>
<list>
<country>
<li>États-Unis</li>
</country>
</list>
<tree>
<country name="États-Unis">
<noRegion>
<name sortKey="Holliday, Wesley H" sort="Holliday, Wesley H" uniqKey="Holliday W" first="Wesley H." last="Holliday">Wesley H. Holliday</name>
</noRegion>
<name sortKey="Hoshi, Tomohiro" sort="Hoshi, Tomohiro" uniqKey="Hoshi T" first="Tomohiro" last="Hoshi">Tomohiro Hoshi</name>
<name sortKey="Hoshi, Tomohiro" sort="Hoshi, Tomohiro" uniqKey="Hoshi T" first="Tomohiro" last="Hoshi">Tomohiro Hoshi</name>
<name sortKey="Icard, Thomas F Iii" sort="Icard, Thomas F Iii" uniqKey="Icard T" first="Thomas F. Iii" last="Icard">Thomas F. Iii Icard</name>
<name sortKey="Icard, Thomas F Iii" sort="Icard, Thomas F Iii" uniqKey="Icard T" first="Thomas F. Iii" last="Icard">Thomas F. Iii Icard</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000062 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000062 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Francis:14-0052693
   |texte=   Information dynamics and uniform substitution
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022