Models of arithmetic and upper bounds for arithmetic sets
From MaRDI portal
Publication:4314684
DOI10.2307/2275921zbMath0862.03022MaRDI QIDQ4314684
Robert I. Soare, Alistair H. Lachlan
Publication date: 27 November 1994
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275921
forcing; models of arithmetic; degrees of models of true arithmetic; upper bounds for the arithmetic sets
03C62: Models of arithmetic and set theory
03D30: Other degrees and reducibilities in computability and recursion theory
03C57: Computable structure theory, computable model theory
Related Items
Models of arithmetic and subuniform bounds for the arithmetic sets, 1995 Annual Meeting of the Association for Symbol Logic, COPYING ONE OF A PAIR OF STRUCTURES, Completions of PA: Models and enumerations of representable sets
Cites Work