Automorphisms of $\omega$-cubes

Notre Dame Journal of Formal Logic 22 (2):120-128 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093883396

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Automorphisms of $\omega$-octahedral graphs.J. C. E. Dekker - 1982 - Notre Dame Journal of Formal Logic 23 (4):427-434.
Combinatorial and recursive aspects of the automorphism group of the countable atomless Boolean algebra.E. W. Madison & B. Zimmermann-Huisgen - 1986 - Journal of Symbolic Logic 51 (2):292-301.
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.
Aristotle’s Cubes and Consequential Implication.Claudio Pizzi - 2008 - Logica Universalis 2 (1):143-153.
On the Relationship Between ID^_.Jeremy Avigad - unknown
On computable automorphisms of the rational numbers.A. S. Morozov & J. K. Truss - 2001 - Journal of Symbolic Logic 66 (3):1458-1470.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
On extensions of $L{\omega \omega }(Q1)$.Xavier Caicedo - 1981 - Notre Dame Journal of Formal Logic 22 (1):85-93.
Models of ${\rm Th}(\langle \omega^\omega<\rangle)$.John W. Rosenthal - 1974 - Notre Dame Journal of Formal Logic 15 (1):122-132.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Bounds for the closure ordinals of essentially monotonic increasing functions.Andreas Weiermann - 1993 - Journal of Symbolic Logic 58 (2):664-671.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.

Analytics

Added to PP
2010-08-24

Downloads
21 (#715,461)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Isols and burnside's lemma.J. C. E. Dekker - 1986 - Annals of Pure and Applied Logic 32:245-263.

Add more citations

References found in this work

No references found.

Add more references