scientific article; zbMATH DE number 1136099

MaRDI QIDQ4381409zbMATH OpenFDO

Authors Anuj Dawar

Publication date 2 November 1998

zbMATH Keywords

complete binary treeEhrenfeucht-Mostowski propertyfinite model theoryfinite variable logicindiscerniblesLöwenheim-Skolem propertyrecursive function

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A restricted second order logic for finite structures
• How many first-order variables are needed on finite ordered structures?
• scientific article; zbMATH DE number 1302669
• On stability in finite models
• Finite Variable Logics in Descriptive Complexity Theory

Cited in

(15)

• Ultrafilters and types on models of arithmetic
• \(\Sigma\)-predicates of finite types over an admissible set
• There is no recursive link between the k-size of a model and its cardinality
• On stability in finite models
• Large finite structures with few \(L^k\)-types
• On existence of limit models over sequences of types
• On uniform definability of types over finite sets
• How many first-order variables are needed on finite ordered structures?
• Krull dimension of types in a class of first-order theories
• scientific article; zbMATH DE number 408792 (Why is no real title available?)
• Modular types in some supersimple theories
• Coherent and Strongly Discrete Rings in Type Theory
• scientific article; zbMATH DE number 1424011 (Why is no real title available?)
• Theories with few non-algebraic types over models, and their decompositions
• On the ubiquity of certain total type structures

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 Q4381409)