scientific article; zbMATH DE number 1007358

zbMATH Open0873.03036MaRDI QIDQ4336034FDOQ4336034

Authors: Wilfrid Hodges 

Publication date: 6 May 1997

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 53151
• A Course on Basic Model Theory
• Model Theory
• 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.

zbMATH Keywords

stabilitymodel theorycategoricityquantifier eliminationomitting types

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Model theory (03Cxx)

Cited In (only showing first 100 items - show all)

• A game-theoretic approach to fault diagnosis and identification of hybrid systems
• The class of polyadic algebras has the super amalgamation property
• Homomorphisms and chains of Kripke models
• A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
• Ramsey degrees, labeled and unlabeled partitions
• Pumping for ordinal-automatic structures1
• Computable structures in generic extensions
• New Ramsey classes from old
• Quantum measurements from a logical point of view
• Some preservation theorems in an intermediate logic
• Indexicals, context-sensitivity and the failure of implication
• Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes
• Linear orderings and powers of characterizable cardinals
• Title not available (Why is that?)
• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
• The 116 reducts of (ℚ, <, a)
• Uniformly defining \(p\)-Henselian valuations
• Reconstructing the topology of clones
• FINITE RELATION ALGEBRAS
• Uncountable graphs and invariant measures on the set of universal countable graphs
• Theories of initial segments of standard models of arithmetics and their complete extensions
• Span, chainability and the continua \(\mathbb H^{\ast}\) and \(\mathbb I_{u}\)
• Automatic synthesis of logical models for order-sorted first-order theories
• Elementarity and dimensions
• Notes on local o-minimality
• The complexity of equality constraint languages
• Maximal infinite-valued constraint languages
• The 42 reducts of the random ordered graph
• Homogeneous and strictly homogeneous criteria for partial structures
• Twin paradox and the logical foundation of relativity theory
• A universality result for endomorphism monoids of some ultrahomogeneous structures
• Combining nonstably infinite theories
• MEREOLOGICAL BIMODAL LOGICS
• Limit groups as limits of free groups.
• Constraint satisfaction problems over the integers with successor
• Countable homogeneous linearly ordered posets
• Truth, dependence and supervaluation: living with the ghost
• Multi-sorted logic and logical geometry: some problems.
• On complex exponentiation restricted to the integers
• Combining non-stably infinite theories
• Reducts of the random partial order
• The \(K\)-theory of assemblers
• Fraïssé and Ramsey properties of Fréchet spaces
• Descendant-homogeneous digraphs
• Local-global convergence, an analytic and structural approach
• Strongly polynomial sequences as interpretations
• On polymorphism-homogeneous relational structures and their clones.
• Classification of some countable descendant-homogeneous digraphs
• Reflexive digraphs with near unanimity polymorphisms
• Integrating Hasse-Schmidt derivations
• Automatic Continuity of Group Homomorphisms
• Weighted o-minimal hybrid systems
• Interpreting nowhere dense graph classes as a classical notion of model theory
• Definability and invariance
• Coding true arithmetic in the Medvedev and Muchnik degrees
• A note on extending actions of infinitesimal group schemes
• Permutations on the random permutation
• Non-dichotomies in Constraint Satisfaction Complexity
• On the automorphism group of homogeneous structures
• Complemented modular lattices with involution and orthogonal geometry
• The mathematical universe
• Modal ontology and generalized quantifiers
• Countable homogeneous lattices
• Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
• Approximations of mappings
• And so on \dots : reasoning with infinite diagrams
• The index set of uncountably categorical theories
• Parallel interpolation, splitting, and relevance in belief change
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Constraint Satisfaction Problems with Infinite Templates
• An initial study of time complexity in infinite-domain constraint satisfaction
• Minimal functions on the random graph
• The class of algebraically closed p-semilattices is finitely axiomatizable
• Reducts of the Henson graphs with a constant
• Beyond Erdős-Kunen-Mauldin: shift-compactness properties and singular sets
• Title not available (Why is that?)
• On countably saturated linear orders and certain class of countably saturated graphs
• GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC
• An abstract decision procedure for satisfiability in the theory of recursive data types
• Dismantlability, connectedness, and mixing in relational structures
• Polyadic spaces and profinite monoids
• \(JSp\)-cosemanticness of \(R\)-modules
• Hintikka and the functions of logic
• Computability-theoretic categoricity and Scott families
• On generalization of definitional equivalence to non-disjoint languages
• Countable homogeneous Steiner triple systems avoiding specified subsystems
• Logics for propositional contingentism
• The property of being a model complete theory is preserved by Cartesian extensions
• Homogeneous completely simple semigroups
• Games for inclusion logic and fixed-point logic
• Computing and dominating the Ryll-Nardzewski function
• Fixed-parameter tractable distances to sparse graph classes
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
• The reducts of the homogeneous binary branching \(C\)-relation
• Varying interpolation and amalgamation in polyadic MV-algebras
• Jordan permutation groups and limits of \(D\)-relations
• Hanf number for Scott sentences of computable structures
• The model theory of commutative near-vector spaces
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Pseudo‐loop conditions

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)