An autostable 2 nilpotent group with no Scott family of finitary formulas.
Page 1 Next
Displaying 1 – 20 of 134
An intensional approach to questions
Pavel Materna (1979)
Kybernetika
Boolean algebras with finite families of computable automorphisms.
Morozov, A.S., Kasymkanuly, Boribaj (2004)
Sibirskij Matematicheskij Zhurnal
Complexity of some natural problems in automatic structures.
Vinokurov, N.S. (2005)
Sibirskij Matematicheskij Zhurnal
Computability in special models.
Puzarenko, V.G. (2005)
Sibirskij Matematicheskij Zhurnal
Computable categoricity versus relative computable categoricity
Rodney G. Downey, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky (2013)
Fundamenta Mathematicae
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1 decidable computably categorical structure is relatively Δ⁰₂ categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also introduce and study a variation of relative computable categoricity, comparing it to both computable...
Computable families of superatomic Boolean algebras.
Alaev, P. E. (2003)
Sibirskij Matematicheskij Zhurnal
Computable structures and operations on the space of continuous functions
Alexander G. Melnikov, Keng Meng Ng (2016)
Fundamenta Mathematicae
We use ideas and machinery of effective algebra to investigate computable structures on the space C[0,1] of continuous functions on the unit interval. We show that (C[0,1],sup) has infinitely many computable structures non-equivalent up to a computable isometry. We also investigate if the usual operations on C[0,1] are necessarily computable in every computable structure on C[0,1]. Among other results, we show that there is a computable structure on C[0,1] which computes + and the scalar multiplication,...
Computably rigid models with enumerable submodels.
Buzykaeva, A.N. (2002)
Sibirskij Matematicheskij Zhurnal
Elementary submodels of parametrizable models.
Morozov, A.S. (2006)
Sibirskij Matematicheskij Zhurnal
Estimation of the algorithmic complexity of classes of computable models.
Pavlovskij, E.N. (2008)
Sibirskij Matematicheskij Zhurnal
Groups of automatic automorphisms of some automatic structures.
Vinokurov, N.S. (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Hyperarithmetical Boolean algebras with a distinguished ideal.
Alaev, P.E. (2004)
Sibirskij Matematicheskij Zhurnal
Index sets of classes of automatic structures.
Vinokurov, N.S. (2006)
Sibirskij Matematicheskij Zhurnal
Index sets of classes of automatic structures.
Vinokurov, N.S. (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Index sets of decidable models.
Fokina, E.B. (2007)
Sibirskij Matematicheskij Zhurnal
On a hierarchy of groups of computable automorphisms.
Morozov, A.S., Buzykaeva, A.N. (2002)
Sibirskij Matematicheskij Zhurnal
On a sufficient condition for strong constructivizability of atomic Boolean algebras.
Dzgoev, V.D. (2000)
Vladikavkazskiĭ Matematicheskiĭ Zhurnal
On constructive nilpotent groups.
Khisamiev, N.G. (2007)
Sibirskij Matematicheskij Zhurnal
On constructivizability of the tensor product of modules.
Latkin, I.V. (2002)
Sibirskij Matematicheskij Zhurnal
Currently displaying 1 – 20 of 134
Page 1 Next