Sergey S Goncharov – författare
Visar alla böcker från författaren Sergey S Goncharov. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
Inbunden, Engelska, 2006
2 104 kr
Skickas inom 5-8 vardagar
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 Leśniewski'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.
Inbunden, Engelska, 2025
1 370 kr
Skickas inom 3-6 vardagar
This volume presents the combined proceedings of two major conferences in mathematical logic — the 16th Asian Logic Conference (ALC) and the 14th International Conference on Computability, Complexity and Randomness (CCR) — held at Nazarbayev University, Astana, Kazakhstan, from 17-21 June 2019 and 23-25 June 2019, respectively. ALC is a prominent international event promoting research and collaboration in logic across the Asia-Pacific region, featuring developments in mathematical logic, logic in computer science, and philosophical logic. CCR focuses on algorithmic information theory, Kolmogorov complexity, and their intersections with computability, complexity theory, and reverse mathematics.This collection brings together leading voices in the field, offering fresh perspectives and state-of-the-art research in logic, computability, set theory, and model theory. It is an essential resource for researchers, scholars, and students interested in contemporary developments in mathematical logic and its applications.