Hanf number for Scott sentences of computable structures

DOI10.1007/S00153-018-0615-6MaRDI QIDQ1756497zbMATH OpenOpenAlexWikidataFDO

Authors J. F. Knight, S. S. Goncharov, Ioannis Souldatos

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

computable structuresinfinitary logicHanf numberScott sentencescharacterizing cardinalshyperarithmetical structures

Mathematics Subject Classification ID

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

Recommendations

• The Hanf number of stationary logic
• A note on the Hanf number of second-order logic
• The Hanf number in the strictly stable case
• An introduction to the Scott complexity of countable structures and a survey of recent results
• A Hanf number for saturation and omission

Cites work

• scientific article; zbMATH DE number 3670442 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Boolean models and infinitary first order languages
• Characterizing the powerset by a complete (Scott) sentence
• Computability of Fraïssé limits
• Computable structures and the hyperarithmetical hierarchy
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Models with compactness properties relative to an admissible language
• Scott sentences and admissible sets
• Strong constructivizability of homogeneous models

Cited in

(9)

• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• The Hanf number of stationary logic
• Hanf numbers and presentation theorems in AECs
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• A note on the Hanf number of second-order logic
• Computable Scott sentences for quasi-Hopfian finitely presented structures
• The Hanf number in the strictly stable case
• Hanf Number for Scott Sentences of Computable Structures
• Scott sentences for equivalence structures

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

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