Classification theory and 0#

Sy D. Friedman; Tapani Hyttinen; Mika Rautila

doi:10.2178/jsl/1052669064

We can help you reset your password using the email address linked to your Project Euclid account.

Registered users receive a variety of benefits including the ability to customize email alerts, create favorite journals list, and save searches. Please note that a Project Euclid web account does not automatically grant access to full-text content. An institutional or society member subscription is required to view non-Open Access content. Contact customer_support@projecteuclid.org with any questions.
View Project Euclid Privacy Policy

All Fields are Required

First Name

Last/Family Name

Password

Password Requirements: Minimum 8 characters, must include as least one uppercase, one lowercase letter, and one number or permitted symbol Valid Symbols for password:
~ Tilde
! Exclamation Mark
@ At sign
$ Dollar sign
^ Caret
( Opening Parenthesis
) Closing Parenthesis
_ Underscore
. Period

Confirm Password

Web Account created successfully

Abstract

We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [Friedman00]) of the potential-isomorphism problem for models of T.

Citation Download Citation

Sy D. Friedman, Tapani Hyttinen, and Mika Rautila "Classification theory and 0^#," Journal of Symbolic Logic 68(2), 580-588, (June 2003). https://doi.org/10.2178/jsl/1052669064

Published: June 2003