Hanf number for Scott sentences of computable structures

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

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

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

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)

Cites Work

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

Cited In (9)

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