| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910450959203321 |
|
|
Titolo |
Mathematical logic in Asia [[electronic resource] ] : proceedings of the 9th Asian Logic Conference, Novosibirsk, Russia, 16-19 August 2005 / / editors, S.S. Goncharov, R. Downey, H. Ono |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Singapore ; ; Hackensack, NJ, : World Scientific, c2006 |
|
|
|
|
|
|
|
ISBN |
|
1-281-92443-1 |
9786611924430 |
981-277-274-X |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (328p.) |
|
|
|
|
|
|
Altri autori (Persone) |
|
DowneyR. G (Rod G.) |
GoncharovS. S |
OnoH |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Logic, Symbolic and mathematical |
Mathematics |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
Another Characterization of the Deduction-Detachment Theorem (S V Babyonyshev); On Behavior of 2-Formulas in Weakly o-Minimal Theories (B S Baizhanov 38; B Sh Kulpeshov); Arithmetic Turing Degrees and Categorical Theories of Computable Models (E Fokina); Negative Data in Learning Languages (S Jain 38; E Kinber); Effective Cardinals in the Nonstandard Universe (V Kanovei 38; M Reeken); Model-Theoretic Methods of Analysis of Computer Arithmetic (S P Kovalyov); The Functional Completeness of Leniewski's Systems (F Lepage); Hierarchies of Randomness Tests (J Reimann 38; F Stephan); Intransitive Linear Temporal Logic Based on Integer Numbers, Decidability, Admissible Logical Consecutions (V V Rybakov); The Logic of Prediction (E Vityaev); Conceptual Semantic Systems Theory and Applications (K E Wolff); Complexity Results on Minimal Unsatisfiable Formulas (X Zhao); and other papers. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
| |