Hanf number for Scott sentences of computable structures

DOI10.1007/S00153-018-0615-6OpenAlexW2962813990WikidataQ59166137 ScholiaQ59166137MaRDI QIDQ1756497

Julia F. Knight, Ioannis Souldatos, Sergei S. Goncharov

Publication date: 14 January 2019

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

infinitary logiccomputable structuresHanf numberScott sentencescharacterizing cardinalshyperarithmetical structures

Mathematics Subject Classification ID

Properties of classes of models (03C52) Other infinitary logic (03C75) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Logic on admissible sets (03C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong constructivizability of homogeneous models
• Computable structures and the hyperarithmetical hierarchy
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Computability of Fraïssé limits
• Scott sentences and admissible sets
• Models with compactness properties relative to an admissible language
• Boolean models and infinitary first order languages
• Characterizing the powerset by a complete (Scott) sentence

This page was built for publication: Hanf number for Scott sentences of computable structures