Computable Structure Theory

A coherent framework of results and techniques in computable structure theory, focusing on the hyperarithmetic and the infinitary languages.

Computable structure theory studies the relative complexity of mathematical structures. This monograph examines structures whose complexity cannot be analyzed using the arithmetic hierarchy. Aimed at graduate students and researchers in mathematical logic, it brings the main results and techniques in the field together into a coherent framework.Computable structure theory quantifies and studies the relative complexity of mathematical structures. This text, in conjunction with the author's previous volume, represents the first full monograph on computable structure theory in two decades. 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. Geared towards graduate students and researchers in mathematical logic, the book enables the reader to learn all the main results and techniques in the area for application in their own research. While the previous volume focused on countable structures whose complexity can be measured within arithmetic, this second volume delves into structures beyond arithmetic, moving into the realm of the hyperarithmetic and the infinitary languages.