Automorphisms of the Lattice of Recursively Enumerable Vector Spaces
β Scribed by Iraj Kalantari
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 910 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
AUTOMORPHISMS O F THE LATTICE OF RECURSIVELY ENUMERABLE VECTOR SPACES by IRAJ KALANTARI in Macomb, Illinois (U.S.A. ) l ) I ) This paper forms a part of the author's dissertation. We would like to acknowledge valuable discussions with GEORGE METAKIDES, ANU NERODE, ALLEN RETZLAFF and RICHARD SHORE. Re are also thankful to the referee for his helpfnl comments, suggestions and for his detect ions of many misprints.
π SIMILAR VOLUMES
## Abstract I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set __IE__ of injectively enumerable classes. It is easy to see that this set is β~5~ in the Arithmetical Hierarchy and I describe a proof for the β~5~βhardness of
## 51. Introduction In recent years. many authors have become reinterested in uhat is called the effective co?ste?it of various mat>hematical systems. That is. authors tend t'o ask questions such as "if we give a structure certain effectivity (identified here as "recursive") conditions \\hat other
In this paper it is shown that the lattice/\_~ of partitions of n under the dominance ordering is totally asymmetric, except for the cases n = 6 and 7 where the automorphism group is Z2XZ 2. As a consequence, partition conjugation is the only antiautomorphism of/\_~ if n ~ 6, 7. L 6 and L 7 the aut