The following pages link to (Q3980817):
Displaying 18 items.
- Algebraic foundations in computer science. Essays dedicated to Symeon Bozapalidis on the occasion of his retirement (Q645927) (← links)
- Abstract algebraic structure of analytic theory of algorithms (Q1069295) (← links)
- First-order approximation of algorithmic theories (Q1095655) (← links)
- Final algebras, cosemicomputable algebras and degrees of unsolvability (Q1199822) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- The theory of computability developed in terms of satisfaction (Q1347606) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Computing coproducts of finitely presented Gödel algebras (Q2503401) (← links)
- Handbook of logic in computer science. Vol. 5: Logical and algebraic methods (Q2753183) (← links)
- (Q3708007) (← links)
- Computability Over Structures of Infinite Signature (Q4210842) (← links)
- Algebraic aspects of the computably enumerable degrees. (Q4326308) (← links)
- Computability of String Functions Over Algebraic Structures Armin Hemmerling (Q4379625) (← links)
- (Q4460832) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- On computable aspects of algebraic and definable closure (Q5028308) (← links)
- Abstract versus concrete computation on metric partial algebras (Q5277710) (← links)
- Abstract computability and algebraic specification (Q5738956) (← links)
