Computer Science Logic
From MaRDI portal
Publication:5311268
DOI10.1007/B100120zbMath1095.03026OpenAlexW2481899496MaRDI QIDQ5311268
A. Fernández-Margarit, F. F. Lara-Martín, Andrés Cordón-Franco
Publication date: 22 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100120
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (2)
Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
This page was built for publication: Computer Science Logic
