Representation theorems for transfinite computability and definability

DOI10.1007/S001530200137zbMATH Open1025.03035OpenAlexW1974400185MaRDI QIDQ1407571

Dag Normann

Publication date: 16 September 2003

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

Full work available at URL: http://hdl.handle.net/10852/42952

zbMATH Keywords

representation theoreminfinite computationpositive inductiondomain with totality

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Inductive definability (03D70)

Related Items (2)

MINIMAL AXIOMATIC FRAMEWORKS FOR DEFINABLE HYPERREALS WITH TRANSFER ⋮ Unnamed Item

This page was built for publication: Representation theorems for transfinite computability and definability