Translator Disclaimer
September 2004 Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π 02-operators
Toshiyasu Arai
J. Symbolic Logic 69(3): 830-850 (September 2004). DOI: 10.2178/jsl/1096901770

Abstract

In this paper, we prove the wellfoundedness of recursive notation systems for reflecting ordinals up to Π3-reflection by relevant inductive definitions.

Citation

Download Citation

Toshiyasu Arai. "Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π 02-operators." J. Symbolic Logic 69 (3) 830 - 850, September 2004. https://doi.org/10.2178/jsl/1096901770

Information

Published: September 2004
First available in Project Euclid: 4 October 2004

zbMATH: 1116.03052
MathSciNet: MR2078925
Digital Object Identifier: 10.2178/jsl/1096901770

Rights: Copyright © 2004 Association for Symbolic Logic

JOURNAL ARTICLE
21 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.69 • No. 3 • September 2004
Back to Top