×

Found 148 Documents (Results 1–100)

100
MathJax

The degree of decidable categoricity of a model with infinite solutions for complete formulas. (English. Russian original) Zbl 07436580

Algebra Logic 60, No. 3, 200-206 (2021); translation from Algebra Logika 60, No. 3, 303-312 (2021).
MSC:  03-XX 20-XX
PDF BibTeX XML Cite
Full Text: DOI

Categoricity spectra of computable structures. (English. Russian original) Zbl 07364537

J. Math. Sci., New York 256, No. 1, 34-50 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 157, 42-58 (2018).
MSC:  03C57 03D45
PDF BibTeX XML Cite
Full Text: DOI

Degrees of categoricity for prime and homogeneous models. (English) Zbl 06932456

Manea, Florin (ed.) et al., Sailing routes in the world of computation. 14th conference on computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10936, 40-49 (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations. (English. Russian original) Zbl 1375.03036

Algebra Logic 54, No. 4, 336-341 (2015); translation from Algebra Logika 54, No. 4, 520-528 (2015).
MSC:  03C57 03C35 03D45
PDF BibTeX XML Cite
Full Text: DOI

Computability and categoricity of ultrahomogeneous structures. (English) Zbl 1433.03082

Beckmann, Arnold (ed.) et al., Language, life, limits. 10th conference on computability in Europe, CiE 2014, Budapest, Hungary, June 23–27, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8493, 1-10 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Computable structure theory on \(\omega_1\) using admissibility. (English) Zbl 1369.03116

Greenberg, Noam (ed.) et al., Effective mathematics of the uncountable. Cambridge: Cambridge University Press; Ithaca, NY: Association for Symbolic Logic (ASL) (ISBN 978-1-107-01451-0/hbk; 978-1-139-02859-2/ebook). Lecture Notes in Logic 41, 50-80 (2013).
MSC:  03D60 03C57 03D45
PDF BibTeX XML Cite

Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism. (English. Russian original) Zbl 1315.03053

Algebra Logic 52, No. 2, 89-97 (2013); translation from Algebra Logika 52, No. 2, 131-144 (2013).
PDF BibTeX XML Cite
Full Text: DOI

Hyperarithmetical categoricity of the Boolean algebra \(B(\omega^\alpha\times\eta)\). (Russian, English) Zbl 1289.03024

Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 12, No. 3, 35-45 (2012); translation in J. Math. Sci., New York 202, No. 1, 40-49 (2014).
MSC:  03C57 03C35 06E05
PDF BibTeX XML Cite

Effective categoricity of injection structures. (English) Zbl 1345.03062

Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 – July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 51-60 (2011).
MSC:  03C57 03C35
PDF BibTeX XML Cite
Full Text: DOI

On autostability of almost prime models relative to strong constructivizations. (English. Russian original) Zbl 1219.03038

Russ. Math. Surv. 65, No. 5, 901-935 (2010); translation from Usp. Mat. Nauk 65, No. 5, 107-142 (2010).
MSC:  03C57 03C35 03D45
PDF BibTeX XML Cite
Full Text: DOI

Computable ordered abelian groups and fields. (English) Zbl 1286.03145

Ferreira, Fernando (ed.) et al., Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30–July 4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13961-1/pbk). Lecture Notes in Computer Science 6158, 321-330 (2010).
PDF BibTeX XML Cite
Full Text: DOI

\(\mathbf 0''\)-categorical completely decomposable torsion-free abelian groups. (English) Zbl 1268.03042

Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 362-371 (2009).
PDF BibTeX XML Cite
Full Text: DOI

\({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures. (English) Zbl 1239.03023

Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 99-108 (2009).
MSC:  03C57 03D15 03D45
PDF BibTeX XML Cite
Full Text: DOI

Isomorphisms and definable relations on computable models. (English) Zbl 1157.03012

Dimitracopoulos, Costas (ed.) et al., Logic colloquium 2005. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Athens, Greece, July 28–August 3, 2005. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-0-521-88425-9/hbk). Lecture Notes in Logic 28, 26-45 (2008).
MSC:  03C57 03D45
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

Software