Punctual definability on structures
暂无分享,去创建一个
[1] A. Montalbán,et al. A computability theoretic equivalent to Vaught’s conjecture , 2012, 1206.5682.
[2] Rodney G. Downey,et al. The complexity of computable categoricity , 2015 .
[3] Matthew Harrison-Trainor,et al. AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES , 2019, The Journal of Symbolic Logic.
[4] R. Downey,et al. RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS , 2019, The Journal of Symbolic Logic.
[5] Keng Meng Ng,et al. Foundations of Online Structure Theory II: The Operator Approach , 2020, Log. Methods Comput. Sci..
[6] Antonio Montalbán. Effectively Existentially-Atomic Structures , 2017, Computability and Complexity.
[7] Rodney G. Downey,et al. Graphs are not universal for online computability , 2020, J. Comput. Syst. Sci..
[8] A. G. Melnikov,et al. The Diversity of Categoricity Without Delay , 2017 .
[9] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[10] Iskander Sh. Kalimullin,et al. FOUNDATIONS OF ONLINE STRUCTURE THEORY , 2019, The Bulletin of Symbolic Logic.
[11] Henry A. Kierstead,et al. An effective version of Dilworth’s theorem , 1981 .
[12] Anil Nerode,et al. Open Questions in the Theory of Automatic Structures , 2008, Bull. EATCS.
[13] Alexander G. Melnikov. Eliminating Unbounded Search in Computable Algebra , 2017, CiE.
[14] Keng Meng Ng,et al. Algebraic structures computable without delay , 2017, Theor. Comput. Sci..