Continuity, proof systems and the theory of transfinite computations

DOI10.1007/S001530200138zbMATH Open1025.03034OpenAlexW2005649416MaRDI QIDQ1407573

Dag Normann

Publication date: 16 September 2003

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

Full work available at URL: http://urn.nb.no/URN:NBN:no-28181

zbMATH Keywords

functionalcompactnesstransfinite computationdomains with totalityE-logic

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Inductive definability (03D70)

Related Items (2)

Title not available (Why is that?) ⋮ Turing determinacy and the continuum hypothesis

This page was built for publication: Continuity, proof systems and the theory of transfinite computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407573)