dissolution
发表于 2025-3-25 07:09:57
Languages, Structures, and TheoriesWe introduce the fundamental concepts of mathematical logic: languages, structures, satisfaction, theories, logical consequences, and definable sets.
NOTCH
发表于 2025-3-25 08:58:35
http://reply.papertrans.cn/16/1557/155640/155640_22.png
污秽
发表于 2025-3-25 15:18:59
http://reply.papertrans.cn/16/1557/155640/155640_23.png
仔细阅读
发表于 2025-3-25 19:40:24
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
发表于 2025-3-25 23:13:53
UltraproductsThe ultraproduct construction is introduced and used to give an alternative proof of the Compactness Theorem.
Lamina
发表于 2025-3-26 00:39:17
http://reply.papertrans.cn/16/1557/155640/155640_26.png
aggrieve
发表于 2025-3-26 08:15:14
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.
使苦恼
发表于 2025-3-26 11:01:06
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
发表于 2025-3-26 13:09:55
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
发表于 2025-3-26 20:23:52
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.