Price loading...

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

Mathematical Logic

Price data last checked 109 day(s) ago - refreshing...

View at Amazon

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

Product Description In mathematics, we know there are some concepts - objects, constructions, structures, proofs - that are more complex and difficult to describe than others. Computable structure theory quantifies and studies the complexity of mathematical structures, structures such as graphs, groups, and orderings. Written by a contemporary expert in the subject, this is the first full monograph on computable structure theory in 20 years. Aimed at graduate students and researchers in mathematical logic, it brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework, making it easier for the reader to learn the main results and techniques in the area for application in their own research. This volume focuses on countable structures whose complexity can be measured within arithmetic; a forthcoming second volume will study structures beyond arithmetic. Book Description Presents main results and techniques in computable structure theory together in a coherent framework for the first time in 20 years. About the Author Antonio Montalbán is Professor of Mathematics at the University of California, Berkeley.

Product Specifications

Format: hardcover
ASIN: 1108423299
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 24 June 2021
Listed Since: 18 February 2021

Barcode

No barcode data available

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

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Computational Complexity: A Conceptual Perspective

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Computability: An Introduction to Recursive Function Theory

Computability Theory: An Introduction to Recursion Theory

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

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

The Foundations of Computability Theory

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

Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach: 138 (Encyclopedia of Mathematics and its Applications, Series Number 138)

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

Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)

Apartness and Uniformity: A Constructive Development (Theory and Applications of Computability)

Distributed Computing Through Combinatorial Topology

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)

Proof And Computation II: From Proof Theory And Univalent Mathematics To Program Extraction And Verification

Combinatorial Set Theory: With a Gentle Introduction to Forcing (Springer Monographs in Mathematics)

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

Language Computability and Formal Language Theory

Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics: 20 (Outstanding Contributions to Logic, 20)

Springer Computational Invariant Theory: 130 Mathematics Book

Constructive Models (Siberian School of Algebra and Logic)

On Sets and Graphs: Perspectives on Logic and Combinatorics

Introduction to Coalgebra: Towards Mathematics of States and Observation: 59 (Cambridge Tracts in Theoretical Computer Science, Series Number 59)

Logical Foundations of Proof Complexity (Perspectives in Logic)