\(\Sigma \)-definability of uncountable models of \(c\)-simple theories

DOI10.1007/S11202-010-0054-ZzbMath1209.03030OpenAlexW2052215186MaRDI QIDQ606059

A. I. Stukachev

Publication date: 15 November 2010

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11202-010-0054-z

zbMATH Keywords

admissible setconstructive modelcomputable theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (2)

Interval extensions of orders and temporal approximation spaces ⋮ \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\)

Cites Work

• Degrees of presentability of structures. II
• Indiscernibles and decidable models
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\Sigma \)-definability of uncountable models of \(c\)-simple theories