The Complexity of Classification Problems for Models of Arithmetic

DOI10.2178/bsl/1286284557zbMath1205.03052arXiv0908.1718OpenAlexW2159754220MaRDI QIDQ3163661

Roman Kossak, Samuel Coskey

Publication date: 26 October 2010

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

Full work available at URL: https://arxiv.org/abs/0908.1718

zbMATH Keywords

models of arithmeticcountable modelsrecursively saturated modelsBorel-completefinitely generated modelsminimal types

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62)

Related Items (1)

The classification of countable models of set theory

Cites Work

• Unnamed Item
• Automorphisms of models of arithmetic: a unified view
• The Borel complexity of isomorphism for theories with many types
• Automorphisms of recursively saturated models of arithmetic
• Full satisfaction classes: A survey
• A Borel reductibility theory for classes of countable structures
• Recursively saturated nonstandard models of arithmetic
• Models and types of Peano's arithmetic
• Borel equivalence relations and classifications of countable models

This page was built for publication: The Complexity of Classification Problems for Models of Arithmetic