Proceedings of the 7th & 8th Asian Logic Conferences: Hsi-Tou, Taiwan, 6-10 June 1999, Chongqing, China, 29 August-2 September 2002The 7th and the 8th Asian Logic Conferences belong to the series of logic conferences inaugurated in Singapore in 1981. This meeting is held once every three years and rotates among countries in the Asia-Pacific region, with interests in the broad area of logic, including theoretical computer science. It is now considered a major conference in this field and is regularly sponsored by the Association for Symbolic Logic.This book contains papers OCo many of them surveys by leading experts OCo of both the 7th meeting (in Hsi-Tou, Taiwan) and the 8th (in Chongqing, China). The volume planned for the 7th meeting was interrupted by the earthquake in Taiwan and the decision was made to combine the two proceedings. The 8th conference is also the ICM2002 Satellite Conference on Mathematical Logic." |
Contents
Elementary Properties of Rogers Semilattices | 1 |
A Logicians Viewpoint | 39 |
Computability Definability and Algebraic Structures | 63 |
Trivial Reals | 103 |
Popper and Miller and Induction and Deduction | 132 |
Enlargements of Polynomial Coalgebras | 152 |
A Layered Approach to Extracting Programs from Proofs with | 193 |
A Common Structure of Logical and Algebraic Algorithms | 222 |
Definability in Local Degree Structures A Survey | 270 |
A Limit Stage Construction for Iterating Semiproper Preorders | 303 |
An Application of NDJ PROP to the Catch and Throw Mechanism | 328 |
The CurryHoward Isomorphism Adapted for Imperative Program | 343 |
PhaseValued Models of Linear Set Theory | 377 |
A Problem on Theories with a Finite Number of Countable Models | 398 |
Sequent Systems for Classical and Intuitionistic Substructural | 423 |
Diamond Embeddings into the D C E Degrees with 0 and 1 Preserved | 443 |
Other editions - View all
Proceedings of the 7th & 8th Asian Logic Conferences: Hsi-Tou, Taiwan, 6-10 ... Rod G. Downey No preview available - 2003 |
Common terms and phrases
algorithm argument axioms basic bisimulation boolean algebra c.e. degree c.e. set cappable coalgebra complexity computably enumerable computably enumerable set Computer Science construction countable models Curry-Howard curve cycle deductive defined Definition denote Downey E(PA element enumerable degrees equivalent example exists fact finite free Abelian groups function functor given graph Harrop formula Hence Hoare logic hypothesis inference rules infinite interpretation intuitionistic isomorphic iteration jump classes Lachlan Lemma Lempp limit ordinal linear ordering logic programming logical formula Math mathematics modal modal logics morphism nodes noncomputable number terms observable oracle Turing machine pair polynomial polynomial-time computable probabilistic logic problem proof properties Proposition prove R-structure real number relation result Rogers semilattices satisfied semantics semilattices sequence set theory Slaman stage structure subset Suppose symbols Theorem Turing degrees Turing machine typosynthesis ultrafilter University variables