The provably terminating operations of the subsystem PETJ of explicit mathematics
From MaRDI portal
Publication:639690
DOI10.1016/j.apal.2011.04.004zbMath1238.03039MaRDI QIDQ639690
Publication date: 22 September 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.04.004
03D15: Complexity of computation (including implicit computational complexity)
03D75: Abstract and axiomatic computability and recursion theory