Algebraic structures computable without delay
From MaRDI portal
Publication:528478
DOI10.1016/J.TCS.2017.01.029zbMATH Open1418.03151OpenAlexW2594352983MaRDI QIDQ528478FDOQ528478
Iskander Kalimullin, Keng Meng Ng, Alexander Melnikov
Publication date: 12 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.029
Recommendations
Cites Work
- The additive group of the rationals does not have an automatic presentation
- BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic Structures: Richness and Limitations
- Title not available (Why is that?)
- Computable structures and the hyperarithmetical hierarchy
- The computable dimension of ordered abelian groups
- Computably categorical fields via Fermat's last theorem
- Subgroups of finitely presented groups
- Title not available (Why is that?)
- CONSTRUCTIVE ALGEBRAS I
- Degrees of categoricity of computable structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computable Algebra, General Theory and Theory of Computable Fields
- Polynomial-time versus recursive models
- Polynomial-time Abelian groups
- Existence and uniqueness of structures computable in polynomial time
- Title not available (Why is that?)
- Recursively presentable prime models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FA-presentable groups and rings
- Computable abelian groups
- Independence in computable algebra
- Space complexity of abelian groups
- An introduction to computable model theory on groups and fields
- Decidable models of \(\omega\)-stable theories
- Recursive Boolean algebras with recursive atoms
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Title not available (Why is that?)
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite Automata Presentable Abelian Groups
- Title not available (Why is that?)
Cited In (40)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- New degree spectra of Polish spaces
- Constructing punctually categorical semigroups
- Primitive recursive equivalence relations and their primitive recursive complexity
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Structures computable in polynomial time. I
- Inversion operations in algebraic structures
- On the main scientific achievements of Victor Selivanov
- Punctually presented structures I: Closure theorems
- Computable embeddability for algebraic structures
- The diversity of categoricity without delay
- Categoricity for primitive recursive and polynomial Boolean algebras
- Eliminating unbounded search in computable algebra
- Primitive recursive reverse mathematics
- Primitive recursive fields and categoricity
- Punctual dimension of algebraic structures in certain classes
- Punctual categoricity relative to a computable oracle
- Non-density in punctual computability
- Punctual 1-linear orders
- Graphs are not universal for online computability
- Punctual copies of algebraic structures
- Online presentations of finitely generated structures
- Punctual definability on structures
- Computably and punctually universal spaces
- The back-and-forth method and computability without delay
- Computable reducibility for computable linear orders of type \(\omega \)
- The complexity of inversion in groups
- Primitively recursive categoricity for unars and equivalence structures
- Punctual categoricity spectra of computably categorical structures
- Rogers semilattices of punctual numberings
- Punctual structures and primitive recursive reducibility
- Title not available (Why is that?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Finitely generated structures computable in polynomial time
- Primitively recursively categorical linear orderings
- On the index set of punctually categorical finitely generated structures
- Quotient structures and groups computable in polynomial time
- Searching for applicable versions of computable structures
- Definable Subsets of Polynomial-Time Algebraic Structures
- A structure of punctual dimension two
This page was built for publication: Algebraic structures computable without delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528478)
