Algebraic structures computable without delay (Q528478): Difference between revisions

From MaRDI portal
← Older edit
Importer (talk | contribs)
Bots
7,080,617 edits
‎Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2017.01.029 / rank
Normal rank
 
Property / author
 
Property / author: Iskander Sh. Kalimullin / rank
Normal rank
 
Property / author
 
Property / author: Alexander G. Melnikov / rank
Normal rank
 
Property / author
 
Property / author: Iskander Sh. Kalimullin / rank
 
Normal rank
Property / author
 
Property / author: Alexander G. Melnikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594352983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and uniqueness of structures computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: DECIDABLE MODELS OF ω-STABLE THEORIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of categoricity of computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5609457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3130249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable dimension of ordered abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presentable prime models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in computable algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computably categorical structure whose expansion by a constant has infinite computable dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Structures: Richness and Limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTIVE ALGEBRAS I / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLE ABELIAN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to computable model theory on groups and fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computably Categorical Fields via Fermat’s Last Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata Presentable Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: FA-presentable groups and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Algebra, General Theory and Theory of Computable Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Boolean algebras with recursive atoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to any nonrecursive set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The additive group of the rationals does not have an automatic presentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerations, countable structures and Turing degrees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2017.01.029 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Algebraic structures computable without delay
scientific article

    Statements

    title
    Algebraic structures computable without delay (English)
    0 references
    author
    Keng Meng Ng
    0 references
    Alexander G. Melnikov
    0 references
    publication date
    12 May 2017
    0 references
    zbMATH Keywords
    polynomial structures
    0 references
    automatic algebra
    0 references
    primitive recursion
    0 references
    cites work
    Q4946095
    0 references
    Q4348127
    0 references
    Q4249724
    0 references
    Q4003861
    0 references
    Q4956005
    0 references
    Q3958432
    0 references
    Q5603320
    0 references
    Q5609457
    0 references
    Q3931264
    0 references
    Q3130249
    0 references
    Q4513969
    0 references
    Q4249727
    0 references
    Q4501152
    0 references
    Q3396632
    0 references
    Q4938557
    0 references
    Q4934290
    0 references
    Q3994998
    0 references
    Q3395521
    0 references
    Q3949039
    0 references
    Q4040892
    0 references

    Identifiers

    zbMATH DE Number
    6715031
    0 references
    OpenAlex ID
    W2594352983
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q528478&oldid=38389587"
    Powered by MediaWiki