Computable Structures and the Hyperarithmetical Hierarchy (Volume 144) (Studies in Logic and the Foundations of Mathematics, Volume 144) - Image 1

Price loading...

Elsevier Computable Structures and the Hyperarithmetical Hierarchy (Volume 144) (Studies in Logic and the Foundations of Mathematics, Volume 144)

Name: Computable Structures and the Hyperarithmetical Hierarchy (Volume 144) (Studies in Logic and the Foundations of Mathematics, Volume 144)
Brand: Elsevier

Engineering & Technology

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).

Key Features

Used Book in Good Condition

Product Specifications

Brand: Elsevier
Format: hardcover
ASIN: 0444500723
Category: Books > Subjects > Science, Nature & Maths > Engineering & Technology
Domain: Amazon UK
Release Date: 20 June 2000
Listed Since: 19 December 2006

Barcode

No barcode data available

Elsevier Computable Structures and the Hyperarithmetical Hierarchy (Volume 144) (Studies in Logic and the Foundations of Mathematics, Volume 144)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Computable Structure Theory: Within the Arithmetic (Perspectives in Logic)

Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Categorical Logic and Type Theory: Volume 141 (Studies in Logic and the Foundations of Mathematics, Volume 141)

Constructivism in Mathematics, Vol 2 (Volume 123) (Studies in Logic and the Foundations of Mathematics, Volume 123)

Computability Theory: An Introduction to Recursion Theory

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Constructive Models (Siberian School of Algebra and Logic)

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures

Power Algebras over Semirings: With Applications in Mathematics and Computer Science: 488 (Mathematics and Its Applications, 488)

The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)

The Foundations of Computability Theory

Semantical Investigations in Heyting's Intuitionistic Logic: 148 (Synthese Library, 148)

Mathematical Logic: On Numbers, Sets, Structures, and Symmetry: 4 (Springer Graduate Texts in Philosophy, 4)

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)

Lectures on the Curry-Howard Isomorphism (Volume 149) (Studies in Logic and the Foundations of Mathematics, Volume 149)

Computability

Noncommutative Algebra: 144 (Graduate Texts in Mathematics, 144)

Sets, Groups, and Mappings: An Introduction to Abstract Mathematics (Pure and Applied Undergraduate Texts)

Logic of Mathematics: A Modern Course of Classical Logic: 22 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

Number Theoretic Density and Logical Limit Laws (Mathematical Surveys and Monographs)

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

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)