- 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
Ordinal analysis of simple cases of bar recursion
Journal of Symbolic Logic 46 (1):17-30 (1981)
Abstract
This article has no associated abstract. (fix it)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
On the physical possibility of ordinal computation (draft).Jeffrey A. Barrett & Wayne Aitken - unknown
Some new double induction and superinduction principles.Raymond M. Smullyan - 1990 - Studia Logica 49 (1):23 - 30.
A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams.Mitsuhiro Okada - 1987 - Journal of Symbolic Logic 52 (3):577-581.
Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy.S. S. Wainer - 1972 - Journal of Symbolic Logic 37 (2):281-292.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
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
2009-01-28
Downloads
47 (#320,752)
6 months
6 (#403,662)
2009-01-28
Downloads
47 (#320,752)
6 months
6 (#403,662)
Historical graph of downloads
Citations of this work
Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.
A direct proof of schwichtenberg’s bar recursion closure theorem.Paulo Oliva & Silvia Steila - 2018 - Journal of Symbolic Logic 83 (1):70-83.
On the no-counterexample interpretation.Ulrich Kohlenbach - 1999 - Journal of Symbolic Logic 64 (4):1491-1511.
On the computational content of the Bolzano-Weierstraß Principle.Pavol Safarik & Ulrich Kohlenbach - 2010 - Mathematical Logic Quarterly 56 (5):508-532.
On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
References found in this work
A new type assignment for λ-terms.M. Coppo & M. Dezani-Ciancaglini - 1978 - Archive for Mathematical Logic 19 (1):139-156.
Über die mit dem Bar-Rekursor vom Typ 0 definierbaren Ordinalzahlen.H. Vogel - 1978 - Archive for Mathematical Logic 19 (1):165-173.
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-6d9b7f7c4c-67rzb uwo