scientific article; zbMATH DE number 1007358
From MaRDI portal
Publication:4336034
This book is a shorter version of the book ``Model theory published by the same author in 1993 (see Zbl 0789.03031). As the book ``Model theory was very voluminous (772 pages), the author was asked by the publisher to write this shorter version. The book ``Model theory was reviewed in detail. So we focus on those things which have changed. Now there are 9 chapters instead of 12 in the former version. Of course the chapters have been shortened. The chapters on automorphism, products and combinatorics have been cancelled. The chapter on categoricity is completely rewritten. Here the author gives a proof of Morley's theorem. He starts with Ehrenfeucht-Mostowski models (formerly in the chapter on combinatorics). Then he develops the machinery needed for the proof of Morley's theorem, such as minimal sets, totally transcendental structures and stability. As in the former book there are hundreds of exercises. Now each chapter ends with a brief commentary for further reading. They replace forty pages of references in the book ``Model theory. This book can be used for graduate courses. As it is shorted now, it is more convenient as an introduction into model theory. Now it is easier for the beginner to become familiar with the main techniques and ideas in model theory. The book contains enough material for several courses.
Recommendations
- scientific article; zbMATH DE number 53151
- A Course on Basic Model Theory
- Model theory: An introduction
- A course in model theory
- scientific article; zbMATH DE number 1015878
- scientific article; zbMATH DE number 957948
- Model theory for beginners. 15 lectures
- Model theory without pain
- Beyond first order model theory
- Model theory.
Cited in
(only showing first 100 items - show all)- Maximal infinite-valued constraint languages
- Homogeneous and strictly homogeneous criteria for partial structures
- Peek arc consistency
- Complemented modular lattices with involution and orthogonal geometry
- Quantifier rank for parity of embedded finite models.
- Countable ultrahomogeneous antimatroids of convex dimension 2
- Tropically convex constraint satisfaction
- A counterexample to the reconstruction of -categorical structures from their endomorphism monoid
- On classes of structures axiomatizable by universal d-Horn sentences and universal positive disjunctions
- Polymorphism clones of homogeneous structures: generating sets, Sierpiński rank, cofinality and the Bergman property
- Automatic synthesis of logical models for order-sorted first-order theories
- Fraïssé limits in comma categories
- Relative exchangeability with equivalence relations
- Higher-order contingentism. III: Expressive limitations
- Relativised homomorphism preservation at the finite level
- Varieties of misrepresentation and homomorphism
- Homogeneous bands
- The wonderland of reflections
- Computability-theoretic categoricity and Scott families
- Hanf number for Scott sentences of computable structures
- Limit groups as limits of free groups.
- An infinite hierarchy of temporal logics over branching time
- Reducts of the random bipartite graph
- Effective algebraicity
- Beyond Erdős-Kunen-Mauldin: shift-compactness properties and singular sets
- Minimal functions on the random graph
- An algebraic view on p-admissible concrete domains for lightweight description logics
- Games and bisimulations for intuitionistic first-order Kripke models
- Unprovability results for clause set cycles
- Using model theory to find decidable and tractable description logics with concrete domains
- Description logics with concrete domains and general concept inclusions revisited
- Decisiveness of stochastic systems and its application to hybrid models
- Jordan permutation groups and limits of \(D\)-relations
- Virtual algebraic isomorphisms between predicate calculi of finite rich signatures
- String orders in the Luttinger liquid phase of one-dimensional spin-1/2 systems
- Bases for structures and theories. I.
- The classification of homomorphism homogeneous tournaments
- The property of being a model complete theory is preserved by Cartesian extensions
- On countably saturated linear orders and certain class of countably saturated graphs
- Dismantlability, connectedness, and mixing in relational structures
- Countable homogeneous Steiner triple systems avoiding specified subsystems
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
- Fraïssé and Ramsey properties of Fréchet spaces
- On polymorphism-homogeneous relational structures and their clones.
- Disjunction and existence properties in inquisitive first-order logic
- Two first-order logics of permutations
- A.D. Taimanov and model theory in Kazakhstan
- On generalization of definitional equivalence to non-disjoint languages
- \(JSp\)-cosemanticness of \(R\)-modules
- Hintikka and the functions of logic
- Computing and dominating the Ryll-Nardzewski function
- Uniformly defining \(p\)-Henselian valuations
- Countable homogeneous lattices
- Refinement in hybridised institutions
- Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs
- Imaginaries in real closed valued fields
- An algebraic approach to belief contraction and nonmonotonic entailment
- Automorphism groups of countably categorical linear orders are extremely amenable
- Truth, dependence and supervaluation: living with the ghost
- Formalizing adequacy: a case study for higher-order abstract syntax
- Fixed-parameter tractable distances to sparse graph classes
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Definability and invariance
- Exponential sums over definable subsets of finite fields
- The mathematical universe
- The embeddability ordering of topological spaces
- Twin paradox and the logical foundation of relativity theory
- Elementarity and dimensions
- Fraïssé structures with universal automorphism groups
- Henselianity in the language of rings
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
- Undirecting membership in models of anti-foundation
- Ramsey equivalence
- Ramsey degrees, labeled and unlabeled partitions
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Polyadic spaces and profinite monoids
- General lower bounds and improved algorithms for infinite-domain CSPs
- Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures
- The degrees of categorical theories with recursive models
- The probability nesting game
- Upward Morley's theorem downward
- Towards finite homomorphism-homogeneous relational structures
- An abstract decision procedure for satisfiability in the theory of recursive data types
- The 42 reducts of the random ordered graph
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
- Reconstructing the topology of clones
- The reducts of the homogeneous binary branching C-relation
- Computable structures in generic extensions
- Integration and cell decomposition in P-minimal structures
- On Turner's theorem and first-order theory
- Uncountable graphs and invariant measures on the set of universal countable graphs
- Computability of Fraïssé limits
- Coding true arithmetic in the Medvedev and Muchnik degrees
- On transitive subrelations of binary relations
- A universality result for endomorphism monoids of some ultrahomogeneous structures
- Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
- The K-theory of assemblers
- Approximations of mappings
- Strongly polynomial sequences as interpretations
- The class of polyadic algebras has the super amalgamation property
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336034)
