Two theorems on degrees of models of true arithmetic

DOI10.2307/2274174zbMath0576.03044OpenAlexW1970452917MaRDI QIDQ3697017

Robert I. Soare, Julia F. Knight, Alistair H. Lachlan

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274174

zbMATH Keywords

refutation of Knight's conjecture

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

Upper bounds for the arithmetical degrees ⋮ Minimal upper bounds for arithmetical degrees ⋮ Models of arithmetic and upper bounds for arithmetic sets ⋮ Degrees of Recursively Saturated Models ⋮ Minimal complementation below uniform upper bounds for the arithmetical degrees

Cites Work

• Unnamed Item
• Unnamed Item
• On the degrees less than 0'
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Class groups of integral group rings

This page was built for publication: Two theorems on degrees of models of true arithmetic