A Course in Mathematical Logic for Mathematicians

DOI10.1007/978-1-4419-0615-1zbMath1180.03002OpenAlexW649400686WikidataQ56270525 ScholiaQ56270525MaRDI QIDQ3639085

Yuri I. Manin

Publication date: 29 October 2009

Published in: Graduate Texts in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-0615-1

zbMATH Keywords

Church's thesistextbookcompletenessforcingcompactnesstruthmodel theoryprovabilityincompletenesscomputabilitymathematical logicrecursive functionsstability theoryclassification theoryconstructible setsDiophantine setsdeducibilityalgorithmic undecidabilitycontinuum problemconstructive universerecursive groups

Mathematics Subject Classification ID

Related Items (11)

A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence ⋮ Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory ⋮ Introduction: computability of the physical ⋮ Renormalisation and computation II: time cut-off and the Halting Problem ⋮ Word problems in Elliott monoids ⋮ Dido's problem and beyond ⋮ ALGEBRAIC LOGIC AND LOGICALLY-GEOMETRIC TYPES IN VARIETIES OF ALGEBRAS ⋮ A formal framework for the study of the notion of undefined particle number in quantum mechanics ⋮ Zipf's law and L. Levin probability distributions ⋮ Некоторые замечания о нестандартных методах анализа. I ⋮ Standard conjectures in model theory, and categoricity of comparison isomorphisms: A model theory perspective

This page was built for publication: A Course in Mathematical Logic for Mathematicians