Iterated trees and fragments of arithmetic

Archive for Mathematical Logic 34 (2):97-112 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

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

Overspill and fragments of arithmetic.C. Dimitracopoulos - 1989 - Archive for Mathematical Logic 28 (3):173-179.
Proof theory of iterated inductive definitions revisited.W. Buchholz - forthcoming - Archive for Mathematical Logic.
Iterated trees of strategies and priority arguments.Steffen Lempp & Manuel Lerman - 1997 - Archive for Mathematical Logic 36 (4-5):297-312.
An algebraic treatment of quantifier-free systems of arithmetic.Franco Montagna - 1996 - Archive for Mathematical Logic 35 (4):209-224.
Iterated multiplication in $$ VTC ^0$$ V T C 0.Emil Jeřábek - 2022 - Archive for Mathematical Logic 61 (5):705-767.
More on cardinal arithmetic.Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (6):399-428.
Model-interpretability into trees and applications.Ivan Korec - 1975 - Archive for Mathematical Logic 17 (3-4):97-104.

Analytics

Added to PP
2013-11-23

Downloads
30 (#740,724)

6 months
12 (#277,123)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

∑2-constructions and I∑1.Marcia Groszek & Tamara Hummel - 1998 - Annals of Pure and Applied Logic 93 (1-3):83-101.

Add more citations

References found in this work

Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.

Add more references