Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMATH Open1145.03322DBLPconf/cie/2006OpenAlexW4255986326MaRDI QIDQ5898846

Anton Setzer

Publication date: 30 April 2007

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

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

zbMATH Keywords

computability theoryMartin-Löf type theoryrecursion theorypartial recursive functionsinductive-recursive definitionsindexed induction-recursionKleene bracketsKleene index

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Second- and higher-order arithmetic and fragments (03F35)

Related Items (4)

A Type of Partial Recursive Functions ⋮ Title not available (Why is that?) ⋮ Partial and nested recursive function definitions in higher-order logic ⋮ Automated Deduction – CADE-19

This page was built for publication: Logical Approaches to Computational Barriers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898846)