Hostname: page-component-76fb5796d-x4r87 Total loading time: 0 Render date: 2024-04-27T09:23:34.775Z Has data issue: false hasContentIssue false
  • English
  • Français

Normal forms for elementary patterns

Published online by Cambridge University Press:  12 March 2014

Timothy J. Carlson  and
Gunnar Wilken
Timothy J. Carlson
Affiliation:
Department of Mathematics, The Ohio State University, 231 W 18th Avenue, Columbus, OH 43210, USA, E-mail: carlson@math.ohio-state.edu
Gunnar Wilken
Affiliation:
Mathematical Biology Unit, Okinawa Institute of Science and Technology, 1919-1 Tancha, Onna-Son, 904-0412 Okinawa, Japan, E-mail: wilken@oist.jp
Get access Rights & Permissions [Opens in a new window]

Abstract

A notation for an ordinal using patterns of resemblance is based on choosing an isominimal set of ordinals containing the given ordinal. There are many choices for this set meaning that notations are far from unique. We establish that among all such isominimal sets there is one which is smallest under inclusion thus providing an appropriate notion of normal form notation in this context. In addition, we calculate the elements of this isominimal set using standard notations based on collapsing functions. This provides a capstone to the results in [2, 6, 8, 9, 7], using further refinement of ordinal arithmetic developed in [8] which then both allows for a simple characterization of normal forms for patterns of order one and will play a key role in the arithmetical analysis of pure patterns of order two, [5].

Keywords

patterns of resemblanceordinal notationsordinal arithmeticproof theoryalgorithms
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 77 , Issue 1 , March 2012 , pp. 174 - 194
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Buchholz, W., Cichon, E. A., and Weiermann, A., A uniform approach to fundamental sequences and hierarchies, Mathematical Logic Quarterly, vol. 40 (1994), pp. 273–286.CrossRefGoogle Scholar
[2]Carlson, T. J., Ordinal arithmetic and Σ1-elementarity, Archive for Mathematical Logic, vol. 38 (1999), pp. 449–460.CrossRefGoogle Scholar
[3]Carlson, T. J., Elementary patterns of resemblance, Annals of Pure and Applied Logic, vol. 108 (2001), pp. 19–77.CrossRefGoogle Scholar
[4]Carlson, T. J., Patterns of resemblance of order 2, Annals of Pure and Applied Logic, vol. 158 (2009), pp. 90–124.CrossRefGoogle Scholar
[5]Carlson, T. J. and Wilken, G., Tracking chains of Σ2-elementarity, submitted.Google Scholar
[6]Wilken, G., The Bachmann–Howard structure in terms of Σ1-elementarily, Archive for Mathematical Logic, vol. 45 (2006), pp. 807–829.CrossRefGoogle Scholar
[7]Wilken, G., Assignment ofordinals to elementary patterns of resemblance, this Journal, vol. 72 (2007), no. 2, pp. 704–720.Google Scholar
[8]Wilken, G., Ordinal arithmetic based on Skolem hulling, Annals of Pure and Applied Logic, vol. 145 (2007), no. 2, pp. 130–161.CrossRefGoogle Scholar
[9]Wilken, G., Σ1-elementarity and Skolem hull operators, Annals of Pure and Applied Logic, vol. 145 (2007), no. 2, pp. 162–175.CrossRefGoogle Scholar