The structural complexity of models of arithmetic

DOI10.1017/JSL.2023.43MaRDI QIDQ7033947zbMATH OpenFDO

Authors Antonio Montalbán, Dino Rossegger

Publication date 3 February 2025

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

zbMATH Keywords

Peano arithmeticarithmeticnonstandard modelsScott rank

Mathematics Subject Classification ID

Descriptive set theory (03E15) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Cites work

• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• scientific article; zbMATH DE number 3399227 (Why is no real title available?)
• A robuster Scott rank
• An example concerning Scott heights
• An interpolation theorem for denumerably long formulas
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• Computable Structure Theory
• Computable structures and the hyperarithmetical hierarchy
• Effective model theory vs. recursive model theory
• Generic copies of countable structures
• Invariant sets in topology and logic
• Models and types of Peano's arithmetic
• Notes on the Jump of a Structure
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Subsystems of second order arithmetic
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• The complexity of classification problems for models of arithmetic
• The structure of models of Peano arithmetic

This page was built for publication: The structural complexity of models of arithmetic

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