| Description |
1 online resource (viii, 319 pages) : illustrations |
| Contents |
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 |
| Summary |
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 |
| Bibliography |
Includes bibliographical references |
| Notes |
Print version record |
| Subject |
Logic, Symbolic and mathematical -- Congresses
|
|
Mathematics -- Congresses
|
|
MATHEMATICS -- Infinity.
|
|
MATHEMATICS -- Logic.
|
|
Logic, Symbolic and mathematical
|
|
Mathematics
|
| Genre/Form |
Conference papers and proceedings
|
| Form |
Electronic book
|
| Author |
Downey, R. G. (Rod G.)
|
|
Goncharov, S. S.
|
|
Ono, H
|
| LC no. |
2007297924 |
| ISBN |
9789812772749 |
|
981277274X |
|
1281924431 |
|
9781281924438 |
|
