A Computation of Partial Isomorphism Rank on Ordinal Structures

Description:

We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.

Creator(s): Bryant, Ross
Creation Date: August 2006
Partner(s):
UNT Libraries
Collection(s):
UNT Theses and Dissertations
Usage:
Total Uses: 84
Past 30 days: 2
Yesterday: 0
Creator (Author):
Publisher Info:
Publisher Name: University of North Texas
Place of Publication: Denton, Texas
Date(s):
  • Creation: August 2006
  • Digitized: April 2, 2008
Description:

We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.

Degree:
Level: Doctoral
Discipline: Mathematics
Language(s):
Subject(s):
Keyword(s): set theory | model theory | logic | foundations of mathematics
Contributor(s):
Partner:
UNT Libraries
Collection:
UNT Theses and Dissertations
Identifier:
  • OCLC: 73156862 |
  • ARK: ark:/67531/metadc5387
Resource Type: Thesis or Dissertation
Format: Text
Rights:
Access: Public
License: Copyright
Holder: Bryant, Ross
Statement: Copyright is held by the author, unless otherwise noted. All rights reserved.