Algebraic structures computable without delay
From MaRDI portal
Publication:528478
Recommendations
Cites work
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 5605134 (Why is no real title available?)
- scientific article; zbMATH DE number 3747093 (Why is no real title available?)
- scientific article; zbMATH DE number 3767640 (Why is no real title available?)
- scientific article; zbMATH DE number 3779289 (Why is no real title available?)
- scientific article; zbMATH DE number 42239 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- scientific article; zbMATH DE number 1499098 (Why is no real title available?)
- scientific article; zbMATH DE number 1531926 (Why is no real title available?)
- scientific article; zbMATH DE number 1390025 (Why is no real title available?)
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- scientific article; zbMATH DE number 1421070 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3323138 (Why is no real title available?)
- scientific article; zbMATH DE number 3332554 (Why is no real title available?)
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- An introduction to computable model theory on groups and fields
- Automatic Structures: Richness and Limitations
- Breaking up finite automata presentable torsion-free Abelian groups.
- CONSTRUCTIVE ALGEBRAS I
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable abelian groups
- Computable structures and the hyperarithmetical hierarchy
- Computably categorical fields via Fermat's last theorem
- Decidable models of \(\omega\)-stable theories
- Degrees of categoricity of computable structures
- Enumerations, countable structures and Turing degrees
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Existence and uniqueness of structures computable in polynomial time
- FA-presentable groups and rings
- Finite Automata Presentable Abelian Groups
- Independence in computable algebra
- Polynomial-time Abelian groups
- Polynomial-time versus recursive models
- Recursive Boolean algebras with recursive atoms
- Recursively presentable prime models
- Relative to any nonrecursive set
- Space complexity of abelian groups
- Subgroups of finitely presented groups
- Subsystems of second order arithmetic
- The additive group of the rationals does not have an automatic presentation
- The computable dimension of ordered abelian groups
Cited in
(40)- Inversion operations in algebraic structures
- On the main scientific achievements of Victor Selivanov
- Quotient structures and groups computable in polynomial time
- Punctually presented structures I: Closure theorems
- Primitively recursively categorical linear orderings
- Constructing punctually categorical semigroups
- Eliminating unbounded search in computable algebra
- Punctual definability on structures
- Searching for applicable versions of computable structures
- On the index set of punctually categorical finitely generated structures
- Finitely generated structures computable in polynomial time
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- New degree spectra of Polish spaces
- Primitive recursive equivalence relations and their primitive recursive complexity
- Primitively recursive categoricity for unars and equivalence structures
- Punctual categoricity spectra of computably categorical structures
- Punctual dimension of algebraic structures in certain classes
- Punctual categoricity relative to a computable oracle
- Computably and punctually universal spaces
- Definable Subsets of Polynomial-Time Algebraic Structures
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Non-density in punctual computability
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- The back-and-forth method and computability without delay
- Punctual 1-linear orders
- The diversity of categoricity without delay
- A structure of punctual dimension two
- Rogers semilattices of punctual numberings
- Punctual structures and primitive recursive reducibility
- The complexity of inversion in groups
- Graphs are not universal for online computability
- Punctual copies of algebraic structures
- Computable embeddability for algebraic structures
- Structures computable in polynomial time. I
- Online presentations of finitely generated structures
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- Categoricity for primitive recursive and polynomial Boolean algebras
- Computable reducibility for computable linear orders of type \(\omega \)
- Primitive recursive reverse mathematics
- Primitive recursive fields and categoricity
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)
