Mathematical Logic In Asia - Proceedings Of The 9th Asian Logic Conference (Hardcover)

This volume is devoted to the main areas of mathematical logic and applications to computer science. There are 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. The problems of characterization of the deduction-detachment theorem, Δ 1-induction, completeness of Lesniewski's systems, and reduction calculus for the satisfiability problem are also discussed. The coverage includes the answer to Kanovei's question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuous functions. The volume also gives some applications to computer science such as solving the problems of inductive interference of languages from the full collection of positive examples and some negative data, the effects of random negative data, methods of formal specification and verification on the basis of model theory and multiple-valued logics, interval fuzzy algebraic systems, the problems of information exchange among agents on the base topological structures, and the predictions provided by inductive theories.

General

Imprint:	World Scientific Publishing Co Pte Ltd
Country of origin:	Singapore
Release date:	October 2006
First published:	October 2006
Editors:	Sergei S. Goncharov • Hiroakira Ono • Rodney G. Downey
Dimensions:	229 x 159 x 22mm (L x W x T)
Format:	Hardcover
Pages:	328
ISBN-13:	978-981-270-045-2
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	981-270-045-5
Barcode:	9789812700452

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!