Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-05-01T12:50:09.638Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive equivalence types and octahedra

Part of: Computability and recursion theory Graph theory

Published online by Cambridge University Press:  09 April 2009

J. C. E. Dekker
J. C. E. Dekker
Affiliation:
The Institute for Advanced StudyPrinceton, New Jersey 08540, U.S.A. Rutgers UniversityNew Brunswick, New Jersey 08903, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let the word “graph” be used in the sense of a countable, connected, simple graph with at least one vertex. We write Qn and Ocn for the graphs associated with the n-cube Qn and the n-octahedron Ocn respectively. In a previous paper (Dekker, 1981) we generalized Qn and Qn to a graph QN and a cube QN, for any nonzero recursive equivalence type N. In the present paper we do the same for Ocn and Ocn. We also examine the nature of the duality between QN and OcN, in case N is an infinite isol. There are c RETs, c denoting the cardinality of the continuum.

MSC classification

Secondary: 03D50: Recursive equivalence types of sets and structures, isols 05C99: None of the above, but in this section
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 34 , Issue 1 , February 1983 , pp. 101 - 113
Copyright
Copyright © Australian Mathematical Society 1983

References

Crossley, J. N. and Nerode, A. (1974), Combinatorial functors (Springer-Verlag, New York).CrossRefGoogle Scholar
Dekker, J. C. E. and Myhill, J. (1960), ‘Recursive equivalence types’, University of California Publications in Mathematics (N.S.) 3, 67–214.Google Scholar
Dekker, J. C. E. (1981), ‘Recursive equivalence types and cubes’, Aspects of effective algebra, ed. Crossley, J. N., pp. 87–121. (Upside Down A Book Company, Yarra Glen, Victoria, Australia).Google Scholar
Dekker, J. C. E. (1981a), ‘Twilight graphs’, J. Symbolic Logic 46, 539–571.Google Scholar
Friedberg, R. M. (1961), ‘The uniqueness of finite division for recursive equivalence types’, Math. Z. 75, 3–7.Google Scholar
Grünbaum, B. (1967), Convex polytopes (Interscience Publishers, New York).Google Scholar
Jungerman, M. and Ringel, G. (1978), ‘The genus of the n-octahedron: regular cases’, J. Graph Theory 2, 69–75.Google Scholar
Nerode, A. (1961), ‘Extensions to isols’, Annals of Mathematics 73, 362–403.Google Scholar
Remmel, J. B. (1981), ‘Effective structures not contained in recursively enumerable structures’, Aspects of effective algebra, ed. Crossley, J. N., pp. 206–225 (Upside Down A Book Company, Yarra Glen, Victoria, Australia).Google Scholar