Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-13T09:13:44.239Z Has data issue: false hasContentIssue false
  • English
  • Français

Encoding orders and trees in binary relations

Part of: Model theory

Published online by Cambridge University Press:  26 February 2010

Wilfrid Hodges
Wilfrid Hodges
Affiliation:
Department of Mathematics, Bedford College, Regent's Park, London NW1 4NS.
Get access

Extract

In Section 1 below I describe two measures of the complexity of a binary relation. J The theorem says that these two measures never disagree very much. Both measures of complexity arose in connection with Saharon Shelah's notion [5] of a stable firstt order theory; Shelah showed in effect that one measure is finite, if, and only if, the other is finite too. This follows trivially from the theorem below. I confess my main aim was not to get the extra information which the theorem provides, but to eliminate Shelah's use of uncountable cardinals, which seemed strangely heavy machinery for proving a purely finitary result. Section 2 below explains the modeltheoretic setting.

MSC classification

Secondary: 03C05: Equational classes, universal algebra
Type
Research Article
Information
Mathematika , Volume 28 , Issue 1 , June 1981 , pp. 67 - 71
Copyright
Copyright © University College London 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Baldwin, J. T. and Lachlan, A. H.. “On universal Horn classes categorical in some infinite power”, Algebra Universalis, 3 (1973), 98–111.CrossRefGoogle Scholar
2.Baur, Walter. “No-categorical modules”, J. Symbolic Logic, 40 (1975), 213–220.CrossRefGoogle Scholar
3.Baur, Walter. “Elimination of quantifiers for modules”, Israel J. Math., 25 (1976), 64–70.CrossRefGoogle Scholar
4.Erdös, P. and Makkai, M.. “Some remarks on set theory, X”, Studia Scient. Math. Hungarica, 1 (1966), 157–159.Google Scholar
5.Shelah, S.. Classification theory (North-Holland, Amsterdam 1978).Google Scholar