Proceedings of the 12Th Asian Logic Conference.:
The Asian Logic Conference is one of the largest meetings, and this volume represents work presented at, and arising from the 12th meeting. It collects a number of interesting papers from experts in the field. It covers many areas of logic.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore :
World Scientific Publishing Company,
2013.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | The Asian Logic Conference is one of the largest meetings, and this volume represents work presented at, and arising from the 12th meeting. It collects a number of interesting papers from experts in the field. It covers many areas of logic. |
| Beschreibung: | 3. Axiomatic Theories L and Ls. |
| Beschreibung: | 1 online resource (346 pages) |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9789814449274 981444927X |
Internformat
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn854974289 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 130803s2013 si ob 001 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCO |d OCLCQ |d DEBSZ |d OCLCQ |d CN3GA |d OCLCO |d YDXCP |d N$T |d STF |d OCLCF |d GGVRL |d OCLCQ |d OCL |d OCLCO |d OCLCQ |d OCLCO |d ZCU |d MERUC |d OCLCQ |d VTS |d ICG |d OCLCQ |d DKC |d AU@ |d OCLCQ |d UKAHL |d OCL |d OCLCQ |d AJS |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 849493514 |a 901572739 |a 1264821530 | ||
| 020 | |a 9789814449274 | ||
| 020 | |a 981444927X | ||
| 020 | |z 9814449261 | ||
| 020 | |z 9789814449267 | ||
| 035 | |a (OCoLC)854974289 |z (OCoLC)849493514 |z (OCoLC)901572739 |z (OCoLC)1264821530 | ||
| 050 | 4 | |a QA9.A1 |b A85 2011 | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 7 | |a 511.3 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Downey, R. G. |q (Rod G.) |1 https://id.oclc.org/worldcat/entity/E39PBJpTYxfKq6fbT6HCrPbmVC |0 http://id.loc.gov/authorities/names/n97054407 | |
| 245 | 1 | 0 | |a Proceedings of the 12Th Asian Logic Conference. |
| 260 | |a Singapore : |b World Scientific Publishing Company, |c 2013. | ||
| 300 | |a 1 online resource (346 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 505 | 0 | |a Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R.G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs. | |
| 505 | 8 | |a 5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M.J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A.R. Day and D.D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms. | |
| 505 | 8 | |a AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References. | |
| 505 | 8 | |a Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax -- L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models. | |
| 505 | 8 | |a 3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models. | |
| 500 | |a 3. Axiomatic Theories L and Ls. | ||
| 520 | |a The Asian Logic Conference is one of the largest meetings, and this volume represents work presented at, and arising from the 12th meeting. It collects a number of interesting papers from experts in the field. It covers many areas of logic. | ||
| 588 | 0 | |a Print version record. | |
| 504 | |a Includes bibliographical references and index. | ||
| 650 | 0 | |a Logic, Symbolic and mathematical |v Congresses. | |
| 650 | 6 | |a Logique symbolique et mathématique |v Congrès. | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Logic, Symbolic and mathematical |2 fast | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Brendle, Jorg. | |
| 700 | 1 | |a Goldblatt, Robert. | |
| 758 | |i has work: |a Proceedings of the 12th Asian Logic Conference (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGVBD4qHcPt3TfhCJWDgJC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Downey, Rod. |t Proceedings of the 12Th Asian Logic Conference. |d Singapore : World Scientific Publishing Company, ©2013 |z 9789814449267 |
| 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=592617 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25272401 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1223952 | ||
| 938 | |a EBSCOhost |b EBSC |n 592617 | ||
| 938 | |a Cengage Learning |b GVRL |n GVRL8RAG | ||
| 938 | |a YBP Library Services |b YANK |n 10752413 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn854974289 |
|---|---|
| _version_ | 1816882240197492736 |
| adam_text | |
| any_adam_object | |
| author | Downey, R. G. (Rod G.) |
| author2 | Brendle, Jorg Goldblatt, Robert |
| author2_role | |
| author2_variant | j b jb r g rg |
| author_GND | http://id.loc.gov/authorities/names/n97054407 |
| author_facet | Downey, R. G. (Rod G.) Brendle, Jorg Goldblatt, Robert |
| author_role | |
| author_sort | Downey, R. G. |
| author_variant | r g d rg rgd |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.A1 A85 2011 |
| callnumber-search | QA9.A1 A85 2011 |
| callnumber-sort | QA 19 A1 A85 42011 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R.G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs. 5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M.J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A.R. Day and D.D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms. AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References. Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax -- L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models. 3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models. |
| ctrlnum | (OCoLC)854974289 |
| 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>05861cam a2200637Mu 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn854974289</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|||||||||</controlfield><controlfield tag="008">130803s2013 si ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CN3GA</subfield><subfield code="d">OCLCO</subfield><subfield code="d">YDXCP</subfield><subfield code="d">N$T</subfield><subfield code="d">STF</subfield><subfield code="d">OCLCF</subfield><subfield code="d">GGVRL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">ZCU</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">ICG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKC</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">849493514</subfield><subfield code="a">901572739</subfield><subfield code="a">1264821530</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814449274</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">981444927X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9814449261</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789814449267</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)854974289</subfield><subfield code="z">(OCoLC)849493514</subfield><subfield code="z">(OCoLC)901572739</subfield><subfield code="z">(OCoLC)1264821530</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.A1</subfield><subfield code="b">A85 2011</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></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Downey, R. G.</subfield><subfield code="q">(Rod G.)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJpTYxfKq6fbT6HCrPbmVC</subfield><subfield code="0">http://id.loc.gov/authorities/names/n97054407</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the 12Th Asian Logic Conference.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore :</subfield><subfield code="b">World Scientific Publishing Company,</subfield><subfield code="c">2013.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (346 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="505" ind1="0" ind2=" "><subfield code="a">Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R.G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M.J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A.R. Day and D.D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax -- L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">3. Axiomatic Theories L and Ls.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Asian Logic Conference is one of the largest meetings, and this volume represents work presented at, and arising from the 12th meeting. It collects a number of interesting papers from experts in the field. It covers many areas of logic.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Logique symbolique et mathématique</subfield><subfield code="v">Congrès.</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">Logic, Symbolic and mathematical</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Conference papers and proceedings</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brendle, Jorg.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldblatt, Robert.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Proceedings of the 12th Asian Logic Conference (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGVBD4qHcPt3TfhCJWDgJC</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="a">Downey, Rod.</subfield><subfield code="t">Proceedings of the 12Th Asian Logic Conference.</subfield><subfield code="d">Singapore : World Scientific Publishing Company, ©2013</subfield><subfield code="z">9789814449267</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=592617</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">AH25272401</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1223952</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">592617</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Cengage Learning</subfield><subfield code="b">GVRL</subfield><subfield code="n">GVRL8RAG</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10752413</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> |
| genre | Conference papers and proceedings fast |
| genre_facet | Conference papers and proceedings |
| id | ZDB-4-EBA-ocn854974289 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:25:28Z |
| institution | BVB |
| isbn | 9789814449274 981444927X |
| language | English |
| oclc_num | 854974289 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (346 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | World Scientific Publishing Company, |
| record_format | marc |
| spelling | Downey, R. G. (Rod G.) https://id.oclc.org/worldcat/entity/E39PBJpTYxfKq6fbT6HCrPbmVC http://id.loc.gov/authorities/names/n97054407 Proceedings of the 12Th Asian Logic Conference. Singapore : World Scientific Publishing Company, 2013. 1 online resource (346 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R.G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs. 5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M.J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A.R. Day and D.D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms. AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References. Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax -- L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models. 3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models. 3. Axiomatic Theories L and Ls. The Asian Logic Conference is one of the largest meetings, and this volume represents work presented at, and arising from the 12th meeting. It collects a number of interesting papers from experts in the field. It covers many areas of logic. Print version record. Includes bibliographical references and index. Logic, Symbolic and mathematical Congresses. Logique symbolique et mathématique Congrès. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Logic, Symbolic and mathematical fast Conference papers and proceedings fast Brendle, Jorg. Goldblatt, Robert. has work: Proceedings of the 12th Asian Logic Conference (Text) https://id.oclc.org/worldcat/entity/E39PCGVBD4qHcPt3TfhCJWDgJC https://id.oclc.org/worldcat/ontology/hasWork Print version: Downey, Rod. Proceedings of the 12Th Asian Logic Conference. Singapore : World Scientific Publishing Company, ©2013 9789814449267 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=592617 Volltext |
| spellingShingle | Downey, R. G. (Rod G.) Proceedings of the 12Th Asian Logic Conference. Preface; Contents; Resolute Sequences in Initial Segment Complexity G. Barmpalias and R.G. Downey; 1. Introduction; 1.1. Formal expressions of resoluteness; 1.2. Resoluteness and complexity; 2. Resoluteness and sparseness; 3. Jump inversion with K-resolute sequences; 4. Completely resolute and resolute-free degrees; Acknowledgments; References; Approximating Functions and Measuring Distance on a Graph W. Calvert, R. Miller and J. Chubb Reimann; 1. Introduction; 2. Reducibilities on Functions; 3. Functions Approximable from Above; 4. The Distance Function in Computable Graphs. 5. Related TopicsAcknowledgments; References; Carnap and McKinsey: Topics in the Pre-History of Possible-Worl Semantics M.J. Cresswell; 1. The `metalinguistic' approach to the logical modalities; 2. Carnap validity; 3. Quine/Carnap validity; 4. Meaning postulates; 5. Classes of models; 6. McKinsey's `syntactical' interpretation; 7. Restricted substitution functions; References; Limits to Joining with Generics and Randoms A.R. Day and D.D. Dzhafarov; 1. Introduction; 2. A non-joining theorem for generics; 3. Extensions to other forcing notions; 4. A non-joining theorem for randoms. AcknowledgementsReferences; Freedom & Consistency M. Detlefsen; 1. Introduction; 2. Freedom & Consistency; 3. The Futility Argument; 4. Premise 2; 5. Premise 3; 6. Conclusion; References; A van Lambalgen Theorem for Demuth Randomness D. Diamondstone, N. Greenberg and D. Turetsky; 1. Introduction; 1.1. Partial relativization vs. full relativization; 1.2. Survey of van Lambalgen's theorem for various randomness notions; 1.3. Notation; 2. A van Lambalgen theorem for Demuth randomness; 3. Does a stronger version of van Lambalgen's theorem hold for Demuth randomness?; References. Faithful Representations of Polishable Ideals S. Gao1. Introduction; 2. Faithful representations for abelian Polish groups; 3. Faithful representations for Polishable ideals; Acknowledgment; References; Further Thoughts on Definability in the Urysohn Sphere I. Goldbring; 1. Introduction; 2. Finitely Definable Sets; 3. Arbitrary Definable Sets; 4. Special Definable Functions; References; Simple Completeness Proofs for Some Spatial Logics of the Real Line I. Hodkinson; 1. Introduction; 2. Definitions; 2.1. Syntax -- L-formulas; 2.2. Kripke semantics; 2.3. Linear orders; 2.4. Linear models. 3. Construction of linear models3.1. Lexicographic sums; 3.2. Intervals of R; 3.3. Shuffles; 4. The logic of R with; 5. The logic of R with and; 6. The logic of R with and; 7. Conclusion; Acknowledgments; References; On a Question of Csima on Computation-Time Domination X. Hua, J. Liu and G. Wu; 1. Introduction; 2. Requirements and basic strategy; 3. Construction; 4. Verification; References; A Generalization of Beth Model to Functionals of High Types F. Kachapova; 1. Introduction; 2. Definitions; 2.1. Definition of Beth model; 2.2. Facts about Beth models. Logic, Symbolic and mathematical Congresses. Logique symbolique et mathématique Congrès. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Logic, Symbolic and mathematical fast |
| title | Proceedings of the 12Th Asian Logic Conference. |
| title_auth | Proceedings of the 12Th Asian Logic Conference. |
| title_exact_search | Proceedings of the 12Th Asian Logic Conference. |
| title_full | Proceedings of the 12Th Asian Logic Conference. |
| title_fullStr | Proceedings of the 12Th Asian Logic Conference. |
| title_full_unstemmed | Proceedings of the 12Th Asian Logic Conference. |
| title_short | Proceedings of the 12Th Asian Logic Conference. |
| title_sort | proceedings of the 12th asian logic conference |
| topic | Logic, Symbolic and mathematical Congresses. Logique symbolique et mathématique Congrès. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Logic, Symbolic and mathematical fast |
| topic_facet | Logic, Symbolic and mathematical Congresses. Logique symbolique et mathématique Congrès. MATHEMATICS Infinity. MATHEMATICS Logic. Logic, Symbolic and mathematical Conference papers and proceedings |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=592617 |
| work_keys_str_mv | AT downeyrg proceedingsofthe12thasianlogicconference AT brendlejorg proceedingsofthe12thasianlogicconference AT goldblattrobert proceedingsofthe12thasianlogicconference |