Titlebook: An Invitation to Mathematical Logic; David Marker Textbook 2024 The Editor(s) (if applicable) and The Author(s), under exclusive license t

dissolution

Languages, Structures, and TheoriesWe introduce the fundamental concepts of mathematical logic: languages, structures, satisfaction, theories, logical consequences, and definable sets.

NOTCH

污穢

仔細閱讀

G?del’s Completeness TheoremUsing the ideas of Henkin, G?del’s Completeness Theorem is proved, showing that our proof system completely captures the notion of logical consequence.

Eclampsia

UltraproductsThe ultraproduct construction is introduced and used to give an alternative proof of the Compactness Theorem.

Lamina

aggrieve

Model Theory of the Real FieldWe study the model theory of the real field, proving Tarski’s quantifier elimination and decidability results and studying its consequences. We include a brief discussion on more recent work on o-minimal expansions of the real field and exponentiation.

使苦惱

Models of ComputationRegister machines are introduced as a machine-based model of computation. We show that register machines compute exactly the class of general recursive functions and formulate the Church–Turing thesis that this is exactly the collection of computable functions.

Carminative

Universal Machines and UndecidabilityTuring’s universal machine is constructed and used to prove the undecidability of the Halting Problem and the undecidability of validity in first-order logic. We include a brief discussion of the Recursion Theorem.

Minutes

Computably Enumerable and Arithmetic SetsWe introduce the computably enumerable sets and the arithmetic sets and show that the form a hierarchy. These results, and the existence of computably inseparable computably enumerably sets, will be used in our approach to the Incompleteness Theorem. We briefly study Kolmogorov randomness as another avatar of incompleteness phenomena.