768 research outputs found
Real closed exponential fields
In an extended abstract Ressayre considered real closed exponential fields
and integer parts that respect the exponential function. He outlined a proof
that every real closed exponential field has an exponential integer part. In
the present paper, we give a detailed account of Ressayre's construction, which
becomes canonical once we fix the real closed exponential field, a residue
field section, and a well ordering of the field. The procedure is constructible
over these objects; each step looks effective, but may require many steps. We
produce an example of an exponential field with a residue field and a
well ordering such that is low and and are ,
and Ressayre's construction cannot be completed in .Comment: 24 page
Classification from a computable viewpoint
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence, in terms of relatively simple invariants. Where this is impossible, it is useful to have concrete results saying so. In model theory and descriptive set theory, there is a large body of work showing that certain classes of mathematical structures admit classification while others do not. In the present paper, we describe some recent work on classification in computable structure theory.
Section 1 gives some background from model theory and descriptive set theory. From model theory, we give sample structure and non-structure theorems for classes that include structures of arbitrary cardinality. We also describe the notion of Scott rank, which is useful in the more restricted setting of countable structures. From descriptive set theory, we describe the basic Polish space of structures for a fixed countable language with fixed countable universe. We give sample structure and non-structure theorems based on the complexity of the isomorphism relation, and on Borel embeddings.
Section 2 gives some background on computable structures. We describe three approaches to classification for these structures. The approaches are all equivalent. However, one approach, which involves calculating the complexity of the isomorphism relation, has turned out to be more productive than the others. Section 3 describes results on the isomorphism relation for a number of mathematically interesting classes—various kinds of groups and fields. In Section 4, we consider a setting similar to that in descriptive set theory. We describe an effective analogue of Borel embedding which allows us to make distinctions even among classes of finite structures. Section 5 gives results on computable structures of high Scott rank. Some of these results make use of computable embeddings. Finally, in Section 6, we mention some open problems and possible directions for future work
Trees of Scot rank ω\u3csub\u3e1\u3c/sub\u3e\u3csup\u3eCK\u3c/sub\u3e, and computable approximability
Makkai [10] produced an arithmetical structure of Scott rank ω 1 CK . In [9], Makkai\u27s example is made computable. Here we show that there are computable trees of Scott rank ω 1 CK . We introduce a notion of “rank homogeneity”. In rank homogeneous trees, orbits of tuples can be understood relatively easily. By using these trees, we avoid the need to pass to the more complicated “group trees” of [10] and [9], Using the same kind of trees, we obtain one of rank ω 1 CK that is “strongly computably approximable”. We also develop some technology that may yield further results of this kind
The arithmetical hierarchy in the setting of
We continue work from (Greenberg and Knight) on computable structure theory in the setting of , where the countable ordinals play the role of natural numbers, and countable sets play the role of finite sets. In the present paper, we define the arithmetical hierarchy through all countable levels (not just the finite levels). We consider two different ways of doing this—one based on the standard definition of the hyperarithmetical hierarchy, and the other based on the standard definition of the effective Borel hierarchy. For each definition, we define computable infinitary formulas through all countable levels, and we obtain analogues of the well-known results from (Ash and Knight, 1989) and (Chisholm, 1990) saying that a relation is relatively intrinsically just in case it is definable by a computable formula. Although we obtain the same results for the two definitions of the arithmetical hierarchy, we conclude that the definition resembling the standard definition of the hyperarithmetical hierarchy seems preferable
Isomorphism relations on computable structures
"Vegeu el resum a l'inici del document del fitxer adjunt"
- …