Two theorems on degrees of models of true arithmetic

DOI10.2307/2274174zbMATH Open0576.03044OpenAlexW1970452917MaRDI QIDQ3697017FDOQ3697017

Authors: Robert I. Soare, J. 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

Recommendations

• Models of arithmetic and upper bounds for arithmetic sets
• Publication:4938559
• scientific article; zbMATH DE number 517082
• scientific article; zbMATH DE number 2222018
• scientific article; zbMATH DE number 2236639

zbMATH Keywords

refutation of Knight's conjecture

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• On the degrees less than 0'
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Title not available (Why is that?)
• Class groups of integral group rings

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Degrees of Recursively Saturated Models
• Minimal upper bounds for arithmetical degrees
• Model-theoretic properties of the \(n\)-c.e. degrees
• Models of arithmetic and upper bounds for arithmetic sets
• Solovay's theorem cannot be simplified
• Upper bounds for the arithmetical degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal complementation below uniform upper bounds for the arithmetical degrees

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

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