Könyv Constructive Models Yuri L. Ershov

Constructive Models

Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 9-13 napon belül
89 782 Ft
Kézbesítjük karácsonyig
The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2013
oldal
293
EAN
9781461369325
ISBN
1461369320
Enbook ID
06796695
Súly
474
Méretek
155 x 235 x 17

Teljes leírás

The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev, Kuznetsov, Rabin, and Vaught in the 50s. Within the framework of this theory, algorithmic properties of abstract models are investigated by constructing representations on the set of natural numbers and studying relations between algorithmic and structural properties of these models. §This book is a very readable exposition of the modern theory of constructive models and describes methods and approaches developed by representatives of the Siberian school of algebra and logic and some other researchers (in particular, Nerode and his colleagues). The main themes are the existence of recursive models and applications to fields, algebras, and ordered sets (Ershov), the existence of decidable prime models (Goncharov, Harrington), the existence of decidable saturated models (Morley), the existence of decidable homogeneous models (Goncharov and Peretyat'kin), properties of the Ehrenfeucht theories (Millar, Ash, and Reed), the theory of algorithmic dimension and conditions of autostability (Goncharov, Ash, Shore, Khusainov, Ventsov, and others), and the theory of computable classes of models with various properties. §Future perspectives of the theory of constructive models are also discussed. Most of the results in the book are presented in monograph form for the first time. §The theory of constructive models serves as a basis for recursive mathematics. It is also useful in computer science, in particular, in the study of programming languages, higher level languages of specification, abstract data types, and problems of synthesis and verification of programs. Therefore, the book will be useful for not only specialists in mathematical logic and the theory of algorithms but also for scientists interested in the mathematical fundamentals of computer science. §The authors are eminent specialists in mathematical logic. They have established fundamental results on elementary theories, model theory, the theory of algorithms, field theory, group theory, applied logic, computable numberings, the theory of constructive models, and the theoretical computer science.

Érdekelheti

Future Networking Essentials

Anil Kumar Rangisetti
18 125 Ft

Sheep Manual

Shankland Liz
10 876 Ft

Manual for Acolytes

Dennis G. Michno
5 751 Ft

Subject of Freedom

Gabriela Basterra
12 149 Ft
11 683 Ft

Plants of Rhode Island

James L Bennett
5 606 Ft
5 134 Ft

Light of Asia

Sir Edwin Arnold
10 832 Ft
10 710 Ft
13 166 Ft
37 742 Ft

Parmenidean Ascent

Michael Della Rocca
19 768 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Pucking sweet

EMILY RATH
6 986 Ft
4 653 Ft

Phenomena tome 1

Bendis Brian Michael
6 899 Ft

Básničky z abecedy

Ivona Ďuričová
3 214 Ft

Rave 17

Hiro Mashima
3 403 Ft

Agua y Ciudades

EMBID IRUJO
32 972 Ft

Kosten der Inflation

Thomas Kaspereit
6 631 Ft
7 575 Ft

Le Kybalion

Trois Initiés
10 594 Ft

Jak šel čas

Hana Zagorová
5 445 Ft
5 256 Ft
111 674 Ft
9 714 Ft