Mathematical logic in Asia : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / editors, S.S. Goncharov, R. Downey, H. Ono.

Includes bibliographical references.

Print version record.

Another characterization of the deduction-detachment theorem / S.V. Babyonyshev -- Computable numberings in the hierarchy of Ershov / S.A. Badaev and Zh. T. Talasbaeva -- On behaviour of 2-formulas in weakly o-minimal theories / B.S. Baizhanov and B. Sh. Kulpeshov -- Proofs about folklore: why model checking = reachability? / K. Choe [and others] -- A note on [symbol] induction / C. Dimitracopoulos and A. Sirokofskich -- Arithmetic Turing degrees and categorical theories of computable models / E. Fokina -- Equivalence relations and classical Banach spaces / S. Gao -- Negative data in learning languages / S. Jain and E. Kinber -- Effective cardinals in the nonstandard universe / V. Kanovei and M. Reeken -- Model-theoretic methods of analysis of computer arithmetic / S.P. Kovalyov -- The functional completeness of Leśniewski's systems / F. Lepage -- Analysis of a new reduction calculus for the satisfiability problem / S. Noureddine -- Elementary type semigroup for Boolean algebras with distinguished ideals / D. Pal'chunov -- Interval fuzzy algebraic systems / D.E. Pal'chunov and G.E. Yakhyaeva -- On orientability and degeneration of Boolean binary relation on a finite set / V. Poplavski -- Hierarchies of randomness tests / J. Reimann and F. Stephan -- Intransitive linear temporal logic based on integer numbers, decidability, admissible logical consecutions / V.V. Rybakov -- Isomorphisms and definable relations on rings and lattices / J.A. Tussupov -- The logic of prediction / E. Vityaev -- The choice of standards for a reporting language / M. Walicki, U. Wolter and J. Stecher -- Conceptual semantic systems theory and applications / K.E. Wolff -- Complexity results on minimal unsatisfiable formulas / X. Zhao.

Devoted to the main areas of mathematical logic and applications to computer science, this volume features articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide