Mathematical logic asia proceedings (4 resultados)

- Tapa dura
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, AlemaniaUniversitätsbuchhandlung Herta Hold GmbH
Contactar con el vendedorVendedor de 3 estrellasCondición: Usado
EUR 22,00
Envío por EUR 30,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
15 x 23 cm. 328 pages. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

- Tapa dura
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 154,49
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
Condición: New. 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.

- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 198,02
Envío por EUR 13,46Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponible
Condición: New. In English.

Idioma: Inglés
Editorial: World Scientific Publishing Company Okt 2006, 2006
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 206,89
Envío por EUR 35,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
Buch. Condición: Neu. Neuware - 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. …