Second Order Definability Via enumerations

DOI10.1002/MALQ.19910370206MaRDI QIDQ3982254zbMATH OpenOpenAlexFDO

Authors Ivan N. Soskov

Publication date 26 June 1992

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19910370206

zbMATH Keywords

external characterizationrecursively enumerable definitional schemessearch computabilitysearch computable functionalssecond order computable objects on abstract structures

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Second-order and Inductive Definability on Finite Structures
• Definability of second order generalized quantifiers
• scientific article; zbMATH DE number 1163949
• scientific article; zbMATH DE number 1163945
• Definability via enumerations
• Characterizing definability of second-order generalized quantifiers
• Definability in the enumeration degrees
• Second-order characterizable cardinals and ordinals
• Definable Sets in Ordered Structures. II
• Determinacy in second order arithmetic

Cited in

(5)

• Computability by means of effectively definable schemes and definability via enumerations
• Second order equivalence of cardinals: An algebraic approach
• scientific article; zbMATH DE number 4154429 (Why is no real title available?)
• scientific article; zbMATH DE number 218551 (Why is no real title available?)
• Ivan Soskov: a life in computability

This page was built for publication: Second Order Definability Via enumerations

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