2007
DOI: 10.1007/s11202-007-0112-3
|View full text |Cite
|
Sign up to set email alerts
|

An autostable 2 nilpotent group with no Scott family of finitary formulas

Abstract: We construct an autostable 2 nilpotent group with no Scott family of finitary formulas but having a unique constructivization up to autoequivalence.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…Tussupov studied algorithmic complexity of the Scott family of formulas for different classes of algebraic structures [327, 328, 329, 330] (2006, 2007). In particular, he built an autostable two-step nilpotent group with a single constructivization up to autoequivalences that has no Scott family of finite formulas [329] (2007). V.P.…”
Section: Constructive and Strongly Constructive Models Computable Numentioning
confidence: 99%
“…Tussupov studied algorithmic complexity of the Scott family of formulas for different classes of algebraic structures [327, 328, 329, 330] (2006, 2007). In particular, he built an autostable two-step nilpotent group with a single constructivization up to autoequivalences that has no Scott family of finite formulas [329] (2007). V.P.…”
Section: Constructive and Strongly Constructive Models Computable Numentioning
confidence: 99%