- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The proof-theoretic analysis of transfinitely iterated fixed point theories
Journal of Symbolic Logic 64 (1):53-67 (1999)
Abstract
This article provides the proof-theoretic analysis of the transfinitely iterated fixed point theories $\widehat{ID}_\alpha and \widehat{ID}_{ the exact proof-theoretic ordinals of these systems are presentedAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Generalizations of the Kruskal-Friedman theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.
About the proof-theoretic ordinals of weak fixed point theories.Gerhard Jäger & Barbara Primo - 1992 - Journal of Symbolic Logic 57 (3):1108-1119.
Some theories with positive induction of ordinal strength ϕω.Gerhard Jäger & Thomas Strahm - 1996 - Journal of Symbolic Logic 61 (3):818-842.
The model-theoretic ordinal analysis of theories of predicative strength.Jeremy Avigad & Richard Sommer - 1999 - Journal of Symbolic Logic 64 (1):327-349.
Ordinals connected with formal theories for transfinitely iterated inductive definitions.W. Pohlers - 1978 - Journal of Symbolic Logic 43 (2):161-182.
The proof theory of classical and constructive inductive definitions. A 40 year saga, 1968-2008.Solomon Feferman - unknown
The Proof-Theoretic Analysis of Transfinitely Iterated Quasi Least Fixed Points.Dieter Probst - 2006 - Journal of Symbolic Logic 71 (3):721 - 746.
Analytics
Added to PP
2009-01-28
Downloads
45 (#345,268)
6 months
13 (#182,749)
2009-01-28
Downloads
45 (#345,268)
6 months
13 (#182,749)
Historical graph of downloads
Author's Profile
Citations of this work
Classes and truths in set theory.Kentaro Fujimoto - 2012 - Annals of Pure and Applied Logic 163 (11):1484-1523.
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts.Kentaro Sato - 2022 - Archive for Mathematical Logic 61 (3):399-435.
Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives.Kentaro Sato - 2020 - Annals of Pure and Applied Logic 171 (3):102754.
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.
References found in this work
Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Zeitshrift für Mathematische Logik Und Grundlagen der Mathematik 35 (1):97--130.
Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Mathematical Logic Quarterly 35 (2):97-130.
Ρ-inaccessible ordinals, collapsing functions and a recursive notation system.Gerhard Jäger - 1984 - Archive for Mathematical Logic 24 (1):49-62.
The [mathematical formula] quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals.Markus Marzetta & Thomas Strahm - 1997 - Archive for Mathematical Logic 36 (6):391-413.
The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\mu$\end{document} quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. [REVIEW]Markus Marzetta & Thomas Strahm - 1998 - Archive for Mathematical Logic 37 (5-6):391-413.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-hc2g5 uwo