Models of arithmetic and upper bounds for arithmetic sets

DOI10.2307/2275921zbMath0862.03022OpenAlexW2078971842MaRDI 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

zbMATH Keywords

forcingmodels of arithmeticdegrees of models of true arithmeticupper bounds for the arithmetic sets

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)

Related Items (4)

COPYING ONE OF A PAIR OF STRUCTURES ⋮ 1995 Annual Meeting of the Association for Symbol Logic ⋮ Models of arithmetic and subuniform bounds for the arithmetic sets ⋮ Completions of PA: Models and enumerations of representable sets

Cites Work

• Two theorems on degrees of models of true arithmetic

This page was built for publication: Models of arithmetic and upper bounds for arithmetic sets