On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T

DOI10.3233/COM-150043OpenAlexW1056431228MaRDI QIDQ2799751

Dag Normann

Publication date: 13 April 2016

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-150043

zbMATH Keywords

Gödel's TCantor-Bendixson ranksearchable

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• LCF considered as a programming language
• Real number computability and domain theory
• An abstract data type for real numbers
• Infinite sets that Satisfy the Principle of Omniscience in any Variety of Constructive Mathematics
• Recursive Functionals and Quantifiers of Finite Types I
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Ordinal analysis of terms of finite type
• Computability over the partial continuous functionals

This page was built for publication: On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T