Pages that link to "Item:Q528478"
From MaRDI portal
The following pages link to Algebraic structures computable without delay (Q528478):
Displayed 19 items.
- Constructing punctually categorical semigroups (Q828124) (← links)
- The diversity of categoricity without delay (Q1688181) (← links)
- Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520) (← links)
- Primitively recursively categorical linear orderings (Q2002476) (← links)
- Primitive recursive fields and categoricity (Q2011324) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← links)
- Punctual categoricity relative to a computable oracle (Q2030137) (← links)
- Punctual definability on structures (Q2033006) (← links)
- Non-density in punctual computability (Q2041959) (← links)
- Punctual copies of algebraic structures (Q2186304) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Structures computable in polynomial time. I (Q2401536) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)