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
This lively introduction to mathematical logic, easily accessible to nonmathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel's theorems, computability and
