My Account Log in

2 options

Proceedings of the 12th Asian Logic Conference : Wellington, New Zealand, 15-20 December, 2011 / edited by Rod Downey, Victoria University, New Zealand, Jorg Brendle, Kobe University, Japan, Robert Goldblatt, Victoria University, New Zealand, Byunghan Kim, Yonsei University, Korea.

EBSCOhost Academic eBook Collection (North America) Available online

View online

Ebook Central Academic Complete Available online

View online
Format:
Book
Conference/Event
Author/Creator:
Asian Logic Conference, Corporate Author.
Contributor:
Downey, R. G. (Rod G.), editor.
Brendle, Jörg, editor.
Goldblatt, Robert, editor.
Kim, Byunghan, 1963- editor.
Conference Name:
Asian Logic Conference (12th : 2011 : Wellington, N.Z.)
Asian Logic Conference.
Series:
Gale eBooks
Language:
English
Subjects (All):
Asia.
Logic, Symbolic and mathematical--Congresses.
Logic, Symbolic and mathematical.
Genre:
Conference papers and proceedings.
Physical Description:
1 online resource (viii, 337 pages) : illustrations (some color)
Place of Publication:
Singapore : World Scientific Pub. Co., 2013.
New Jersey : World Scientific, [2013]
Language Note:
English
Summary:
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.
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
3. Axiomatic Theories L and Ls
Notes:
Description based upon print version of record.
Includes bibliographical references.
ISBN:
9789814449274
981444927X
OCLC:
849493514

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account