Computability of partial functions and enumerability of sets in Peano's arithmetic
From MaRDI portal
Publication:1147131
DOI10.1007/BF00970389zbMath0449.03036MaRDI QIDQ1147131
Publication date: 1980
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Undecidability and degrees of sets of sentences (03D35) Recursive functions and relations, subrecursive hierarchies (03D20) Model theory of denumerable and separable structures (03C15)
Cites Work