Ordinal arithmetic with simultaneously defined theta‐functions

&
Mathematical Logic Quarterly 57 (2):116-132 (2011)
  Copy   BIBTEX

Abstract

This article provides a detailed comparison between two systems of collapsing functions. These functions play a crucial role in proof theory, in the analysis of patterns of resemblance, and the analysis of maximal order types of well partial orders. The exact correspondence given here serves as a starting point for far reaching extensions of current results on patterns and well partial orders. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.200910125

Other Versions

No versions found

Links

PhilArchive

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

Normal forms for elementary patterns.Timothy J. Carlson & Gunnar Wilken - 2012 - Journal of Symbolic Logic 77 (1):174-194.
Nisan-Wigderson generators in proof systems with forms of interpolation.Ján Pich - 2011 - Mathematical Logic Quarterly 57 (4):379-383.
Ordinal notation systems corresponding to Friedman’s linearized well-partial-orders with gap-condition.Michael Rathjen, Jeroen Van der Meeren & Andreas Weiermann - 2017 - Archive for Mathematical Logic 56 (5-6):607-638.
Notes on Craig interpolation for LJ with strong negation.Norihiro Kamide - 2011 - Mathematical Logic Quarterly 57 (4):395-399.
Ordinal arithmetic based on Skolem hulling.Gunnar Wilken - 2007 - Annals of Pure and Applied Logic 145 (2):130-161.
Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.
A set of axioms for nonstandard extensions.Abhijit Dasgupta - 2011 - Mathematical Logic Quarterly 57 (5):485-493.
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.
Well-Partial Orderings and their Maximal Order Types.Diana Schmidt - 2020 - In Peter M. Schuster, Monika Seisenberger & Andreas Weiermann, Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory. Cham: Springer Verlag. pp. 351-391.
An ordinal analysis of admissible set theory using recursion on ordinal notations.Jeremy Avigad - 2002 - Journal of Mathematical Logic 2 (1):91-112.

Analytics

Added to PP
2013-11-03

Downloads
82 (#687,564)

6 months
22 (#486,706)

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.
Tracking chains of Σ 2 -elementarity.Timothy J. Carlson & Gunnar Wilken - 2012 - Annals of Pure and Applied Logic 163 (1):23-67.
Fundamental sequences based on localization.Gunnar Wilken - 2026 - Annals of Pure and Applied Logic 177 (1):103658.
Bachmann–Howard derivatives.Anton Freund - 2023 - Archive for Mathematical Logic 62 (5):581-618.

Add more citations

References found in this work

Proof theory.Gaisi Takeuti - 1975 - New York: American Elsevier Pub. Co..
Proof theory.K. Schütte - 1977 - New York: Springer Verlag.
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

View all 19 references / Add more references