Non-determinism in Gödel's system T
DOI10.1007/S00224-011-9377-9zbMATH Open1271.03049OpenAlexW2022103417MaRDI QIDQ693050FDOQ693050
Authors: Lars Kristiansen, Bedeho Mesghina Wolde Mender 
Publication date: 7 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9377-9
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- Domain-Theoretic Foundations of Functional Programming
- Classical recursion theory. Vol. II
- Title not available (Why is that?)
- New Computational Paradigms
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- Higher types, finite domains and resource-bounded Turing machines
- Programming languages capturing complexity classes
- Recursion in Higher Types and Resource Bounded Turing Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Science Logic
- New Computational Paradigms
- Logical Approaches to Computational Barriers
- Theory and Applications of Models of Computation
Cited In (3)
This page was built for publication: Non-determinism in Gödel's system \(T\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693050)
