The theory of lists and -definability

MaRDI QIDQ447718zbMATH OpenFDO

Authors Aleksandra Anatol'evna Gavryushkina

Publication date 5 September 2012

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

zbMATH Keywords

recursion theorem\(\Sigma\)-definabilitytheory of lists

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• TOWARDS A THEORY OF DEFINABLE SETS
• A list of arithmetical structures complete with respect to the first-order definability
• Definability via enumerations
• On \(\Sigma\)-definability of hereditarily finite and list superstructures
• Logic for Programming, Artificial Intelligence, and Reasoning
• scientific article; zbMATH DE number 1302874
• Definable families of theories, related calculi and ranks
• On arithmetical first-order theories allowing encoding and decoding of lists
• On decidability of list structures
• Definability in the local theory of the \(\omega \)-enumeration degrees

Cited in

(4)

• scientific article; zbMATH DE number 5695342 (Why is no real title available?)
• Refined definitions for finitary and infinitary similarity relations of theories. I: Signature reduction procedures and constructions shortly, and fast definitions for finitary and infinitary lists
• scientific article; zbMATH DE number 3845031 (Why is no real title available?)
• A list of arithmetical structures complete with respect to the first-order definability

This page was built for publication: The theory of lists and \(\Sigma\)-definability

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