headerdesktop englezatrgr17apr26

MAI SUNT 00:00:00:00

MAI SUNT

X

headermobile englezatrgr17apr26

MAI SUNT 00:00:00:00

MAI SUNT

X

Transport Gratuit la comenzile de peste 75 lei

Promotii popup img

💙English Books cu -20% -30%💙

și

Transport Gratuit peste 75 lei🚀

Hai la răsfoit →

Transport Gratuit la comenzile de peste 75 lei

Model Theory for Beginners. 15 Lectures

De (autor): Roman Kossak

Coperta cărții 'Model Theory for Beginners. 15 Lectures - Roman Kossak'
Model Theory for Beginners. 15 Lectures

De (autor): Roman Kossak


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.

Citește mai mult

-20%

transport gratuit

PRP: 152.93 Lei

!

Acesta este Prețul Recomandat de Producător. Prețul de vânzare al produsului este afișat mai jos.

122.34Lei

122.34Lei

152.93 Lei

Primești 122 puncte

Important icon msg

Primești puncte de fidelitate după fiecare comandă! 100 puncte de fidelitate reprezintă 1 leu. Folosește-le la viitoarele achiziții!

Livrare in 2-4 saptamani

Descrierea produsului


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.

Citește mai mult

S-ar putea să-ți placă și

De același autor

Părerea ta e inspirație pentru comunitatea Libris!

Istoricul tău de navigare

Acum se comandă

Noi suntem despre cărți, și la fel este și

Newsletter-ul nostru.

Abonează-te la veștile literare și primești un cupon de -10% pentru viitoarea ta comandă!

*Reducerea aplicată prin cupon nu se cumulează, ci se aplică reducerea cea mai mare.

Mă abonez image one
Mă abonez image one
Accessibility Logo