Constructive Models (Siberian School of Algebra and Logic) - Image 1

£146.43

Springer Constructive Models (Siberian School of Algebra and Logic)

Name: Constructive Models (Siberian School of Algebra and Logic)
Brand: Springer
Price: 146.43 GBP
Availability: InStock

Algorithms

This is the most expensive it has ever been. Walk away.

£146 today · previous high £146 · all-time low £126

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 7 days • 7 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 7 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £126 (6 days, 85.7%)

Price range: £126 - £146

Price levels: 2 different prices over 7 days

Description

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 haveestablished 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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1461369320
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Publication Date: 28 September 2012
Listed Since: 14 July 2013

Barcode

No barcode data available

Springer Constructive Models (Siberian School of Algebra and Logic)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Constructive Models (Siberian School of Algebra and Logic)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

An Invitation to Mathematical Logic: 301 (Graduate Texts in Mathematics, 301)

An Invitation to Mathematical Logic: 301 (Graduate Texts in Mathematics, 301)

MATHEMATICAL LOGIC OTIL PAPER: 3 (Oxford Texts in Logic)

Introduction to Mathematical Logic: Set Theory Computable Functions Model Theory (Undergraduate Texts in Mathematics)

Models of Peano Arithmetic: 15 (Oxford Logic Guides)

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

Mathematical Logic: Exercises and Solutions (Problem Books in Mathematics)

Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995: 11 (Lecture Notes in Logic, Series Number 11)

Recursion Theory, Godel's Theorems, Set Theory, Model Theory (Mathematical Logic: A Course With Exercises, Part II)

Residuated Lattices: An Algebraic Glimpse at Substructural Logics

A First Course in Mathematical Logic and Set Theory

Gödel's Incompleteness Theorems: A Guided Tour Through Kurt Gödel’s Historic Proof

Logic for Mathematicians

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Logics for Computer and Data Sciences, and Artificial Intelligence: 992 (Studies in Computational Intelligence, 992)

Computational Logic: 165 (NATO ASI Subseries F:, 165)

Functional Interpretations: From the Dialectica Interpretation to Functional Interpretations of Analysis and Set Theory

A Modern Perspective on Type Theory: From its Origins until Today: 29 (Applied Logic Series, 29)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

A Modern Perspective on Type Theory: From its Origins until Today: 29 (Applied Logic Series, 29)