Definability via enumerations

DOI10.2307/2274858MaRDI QIDQ3483272zbMATH OpenOpenAlexFDO

Authors Ivan N. Soskov

Publication date 1989

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274858

zbMATH Keywords

\(\forall \)-admissibilitypartial structure with denumerable domainrelative computability in abstract structuressearch computabilitysearch-computable functionsSkordev's conjecture

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 3930992
• scientific article; zbMATH DE number 4145890
• scientific article; zbMATH DE number 5000345
• Admissible functionals in abstract structures with arbitrary power
• Publication:3483273

Cited in

(25)

• Computability by means of effectively definable schemes and definability via enumerations
• Definability and almost disjoint families
• Definability for model counting
• Definability and invariance
• Definability aspects of the Denjoy integral
• Enumeration reducibility and computable structure theory
• Characterization of the effective computability in \({\mathfrak f}\)-enumerations
• Admissible functionals in abstract structures with arbitrary power
• scientific article; zbMATH DE number 5000345 (Why is no real title available?)
• scientific article; zbMATH DE number 4145891 (Why is no real title available?)
• scientific article; zbMATH DE number 4154429 (Why is no real title available?)
• scientific article; zbMATH DE number 4059373 (Why is no real title available?)
• Second Order Definability Via enumerations
• The theory of lists and \(\Sigma\)-definability
• scientific article; zbMATH DE number 6984345 (Why is no real title available?)
• A combinatorial version of the Svenonius theorem on definability
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
• Definable combinatorics at the first uncountable cardinal
• Exact effective enumerations of total functional structures
• Least enumerations of unary partial structures
• Some properties of an algebra of all sets of naturals e-reducible to a fixed set
• scientific article; zbMATH DE number 7147443 (Why is no real title available?)
• Toward a Theory of Enumerations
• Ivan Soskov: a life in computability
• Definability with bounded number of bound variables

This page was built for publication: Definability via enumerations

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