Completions of PA: Models and enumerations of representable sets

DOI10.2307/2586727zbMath0916.03037OpenAlexW1978691406MaRDI QIDQ4227885

Alex M. McAllister

Publication date: 6 July 1999

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

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

zbMATH Keywords

forcingScott setjump idealcoding sets for computable subtreescompletions of Peano ArithmeticTrue Arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)

Related Items (1)

1998–99 Annual Meeting of the Association for Symbolic Logic

Cites Work

• Upper bounds for the arithmetical degrees
• Models of arithmetic and upper bounds for arithmetic sets
• Unnamed Item

This page was built for publication: Completions of PA: Models and enumerations of representable sets