|
|
|
|
LEADER |
00000cam a2200000 i 4500 |
001 |
000113483 |
005 |
20220426044716.1 |
008 |
210323t2021 enka gr 001 0 eng d |
020 |
|
|
|a 9781848903616
|q (rústica)
|
040 |
|
|
|a YDX
|b eng
|e rda
|c YDX
|d OCLCO
|d MX-MxUAM
|
041 |
0 |
|
|a eng
|
050 |
|
4 |
|a QA9.7
|b K6.77
|
090 |
|
|
|a QA9.7
|b K6.77
|
100 |
1 |
|
|a Kossak, Roman,
|d 1953-,
|e autor
|
245 |
1 |
4 |
|a Model theory for beginners :
|b 15 lectures /
|c Roman Kossak.
|
264 |
|
1 |
|a [London] :
|b College Publications,
|c [2021].
|
264 |
|
4 |
|a ©2021.
|
300 |
|
|
|a xii, 138 páginas :
|b ilustraciones ;
|c 24 cm.
|
336 |
|
|
|a texto
|b txt
|2 rdacontent
|
337 |
|
|
|a sin medio
|b n
|2 rdamedia
|
338 |
|
|
|a volumen
|b nc
|2 rdacarrier
|
490 |
1 |
|
|a Studies in logic
|v 90
|
504 |
|
|
|a Incluye referencias bibliográficas : páginas 135-136 e índice
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Model theory
|
650 |
|
4 |
|a Modelos, Teoría de
|
830 |
|
0 |
|a Studies in logic ;
|v 90
|
905 |
|
|
|a LIBROS
|
938 |
|
|
|a Comunidad
|c CSH
|
949 |
|
|
|a Biblioteca UAM Iztapalapa
|b Colección General
|c QA9.7 K6.77
|