Computer Science Logic

DOI10.1007/b13224zbMath1116.68395OpenAlexW2623947920MaRDI QIDQ5292648

Lars Kristiansen, Paul J. Voda

Publication date: 21 June 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Higher-type and set recursion theory (03D65)

Related Items (5)

A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ Pure Iteration and Periodicity ⋮ Recursion in Higher Types and Resource Bounded Turing Machines ⋮ Non-determinism in Gödel's system \(T\) ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)

This page was built for publication: Computer Science Logic