| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662130 | Annals of Pure and Applied Logic | 2010 | 37 Pages |
Abstract
In this paper, we give two proofs of the wellfoundedness of a recursive notation system for ΠN-reflecting ordinals. One is based on distinguished classes, and the other is based on -inductive definitions.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
