A non-well-founded primitive recursive tree provably well-founded for co-r. e. sets

DOI10.1007/S001530100107zbMath1023.03055OpenAlexW2120261289MaRDI QIDQ1407539

Arnold Beckmann

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530100107

zbMATH Keywords

well-foundednessrecursive ordinalsorder-typesprimitive recursive treeprimitive recursive well-orderings

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

This page was built for publication: A non-well-founded primitive recursive tree provably well-founded for co-r. e. sets