Knygos.lt klubas Knygos.lt nariams
24,98 €
-30%
Įprastai
35,69 €
Model Theory for Beginners. 15 Lectures
Model Theory for Beginners. 15 Lectures
Knygos.lt klubas Knygos.lt nariams
24,98 €
-30%
Įprastai
35,69 €
  • Išsiųsime per 12–18 d.d.
This book presents an introduction to model theory in 15 lectures. It concentrates on several key concepts: first-order definability, classification of complete types, elementary extensions, categoricity, automorphisms, and saturation; all illustrated with examples that require neither advanced alegbra nor set theory. A full proof of the compactness theorem for countable languages and its applications are given, followed by a discussion of the Ehrefeucht-Mostowski technique for constructing mod…

Model Theory for Beginners. 15 Lectures (el. knyga) (skaityta knyga) | knygos.lt

Atsiliepimai

Aprašymas

This book presents an introduction to model theory in 15 lectures. It concentrates on several key concepts: first-order definability, classification of complete types, elementary extensions, categoricity, automorphisms, and saturation; all illustrated with examples that require neither advanced alegbra nor set theory. A full proof of the compactness theorem for countable languages and its applications are given, followed by a discussion of the Ehrefeucht-Mostowski technique for constructing models admitting automorphisms. Additional topics include recursive saturation, nonstandard models of arithmetic, Abraham Robinson's model-theoretic proof of Tarski's theorem on undefinability of truth, and the proof of the Infinite Ramsey Theorem using an elementary extension of the standard model of arithmetic.

Knygos.lt klubas
Knygos.lt nariams
24,98 €
-30%
Įprastai
35,69 €
Kaina registruotiems pirkėjams
Prisijunkite ir už šią prekę
gausite 0,36 Knygų Eurų!?
Išsiųsime per 12–18 d.d.
Įsigykite dovanų kuponą
Daugiau

This book presents an introduction to model theory in 15 lectures. It concentrates on several key concepts: first-order definability, classification of complete types, elementary extensions, categoricity, automorphisms, and saturation; all illustrated with examples that require neither advanced alegbra nor set theory. A full proof of the compactness theorem for countable languages and its applications are given, followed by a discussion of the Ehrefeucht-Mostowski technique for constructing models admitting automorphisms. Additional topics include recursive saturation, nonstandard models of arithmetic, Abraham Robinson's model-theoretic proof of Tarski's theorem on undefinability of truth, and the proof of the Infinite Ramsey Theorem using an elementary extension of the standard model of arithmetic.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
(rodomas nebus)