Normal forms for elementary patterns

Journal of Symbolic Logic 77 (1):174-194 (2012)
  Copy   BIBTEX

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]

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

The elementary forms of the religious life.Émile Durkheim - 1926 - New York,: The Macmillan company. Edited by Joseph Ward Swain.
A Tractarian Universe.Albert Visser - 2012 - Journal of Philosophical Logic 41 (3):519-545.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Ultimate Normal Forms for Parallelized Natural Deductions.Neil Tennant - 2002 - Logic Journal of the IGPL 10 (3):299-337.
When Normal and Extensive Form Decisions Differ.Teddy Seidenfeld - 1994 - In Dag Prawitz, Brian Skyrms & Dag Westerståhl (eds.), Logic, Methodology and Philosophy of Science. Elsevier. pp. 451-463.
Elementary realizability.Zlatan Damnjanovic - 1997 - Journal of Philosophical Logic 26 (3):311-339.
Normal monomodal logics can simulate all others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.

Analytics

Added to PP
2012-01-21

Downloads
31 (#514,567)

6 months
9 (#304,685)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Pure Σ2-elementarity beyond the core.Gunnar Wilken - 2021 - Annals of Pure and Applied Logic 172 (9):103001.
Pure patterns of order 2.Gunnar Wilken - 2018 - Annals of Pure and Applied Logic 169 (1):54-82.
Tracking chains of Σ 2 -elementarity.Timothy J. Carlson & Gunnar Wilken - 2012 - Annals of Pure and Applied Logic 163 (1):23-67.
Arithmetical algorithms for elementary patterns.Samuel A. Alexander - 2015 - Archive for Mathematical Logic 54 (1-2):113-132.

Add more citations

References found in this work

Elementary patterns of resemblance.Timothy J. Carlson - 2001 - Annals of Pure and Applied Logic 108 (1-3):19-77.
Ordinal arithmetic and $\Sigma_{1}$ -elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.
Patterns of resemblance of order 2.Timothy J. Carlson - 2009 - Annals of Pure and Applied Logic 158 (1-2):90-124.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.

View all 7 references / Add more references