Higher Types, Finite Domains and Resource-bounded Turing Machines

DOI10.1093/logcom/exq009zbMath1255.68052OpenAlexW2076940966MaRDI QIDQ2882561

Lars Kristiansen

Publication date: 7 May 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/91ccdad2fa0eb9c0d8db41545fa5f6cc64c452d1

zbMATH Keywords

recursionPCFdomain theory Gödel's Thigher type

Mathematics Subject Classification ID

Related Items (3)

Non-determinism in Gödel's system \(T\) ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Higher Types, Finite Domains and Resource-bounded Turing Machines