Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T10:20:40.584Z Has data issue: false hasContentIssue false

Categoricity regained

Published online by Cambridge University Press:  12 March 2014

Erik Ellentuck*
Affiliation:
Rutgers, The State University, New Brunswick, New Jersey 08903

Extract

One of the earliest goals of modern logic was to characterize familiar mathematical structures up to isomorphism by means of properties expressed in a first order language. This hope was dashed by Skolem's discovery (cf. [6]) of a nonstandard model of first order arithmetic. A theory T such that any two of its models are isomorphic is called categorical. It is well known that if T has any infinite models then T is not categorical. We shall regain categoricity by

(i) enlarging our language so as to allow expressions of infinite length, and

(ii) enlarging our class of isomorphisms so as to allow isomorphisms existing in some Boolean valued extension of the universe of sets.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1976

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

Article purchase

Temporarily unavailable