Add to ORKGWe give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem
summary:We consider the question of which loops are capable of expressing arbitrary Boolean function...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
We contribute to a recent research program which aims at revisiting the study of the complexity of w...
This dissertation uses the connections between loops and their associated permutation groups to stud...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
summary:A family of loops is studied, which arises with its binary operation in a natural way from s...
AbstractThe paper proposes a permutation representation concept for loops. A permutation representat...
International audienceWe consider the MSO model-checking problem for simple linear loops, or equival...
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexi...
We present a survey of our work over the last four decades on generalizations of computability theor...
This thesis shows that the Zorn vector matrix construction which Paige used to construct simple nona...
In topology loop spaces can be understood combinatorially using algebraic theories. This approach ca...
The classes of real and complex C*-algebras share significant similarities with the class of groups,...
summary:We present some novel classification results in quasigroup and loop theory. For quasigroups ...
summary:We investigate the situation when the inner mapping group of a commutative loop is of order ...
summary:We consider the question of which loops are capable of expressing arbitrary Boolean function...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
We contribute to a recent research program which aims at revisiting the study of the complexity of w...
This dissertation uses the connections between loops and their associated permutation groups to stud...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
summary:A family of loops is studied, which arises with its binary operation in a natural way from s...
AbstractThe paper proposes a permutation representation concept for loops. A permutation representat...
International audienceWe consider the MSO model-checking problem for simple linear loops, or equival...
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexi...
We present a survey of our work over the last four decades on generalizations of computability theor...
This thesis shows that the Zorn vector matrix construction which Paige used to construct simple nona...
In topology loop spaces can be understood combinatorially using algebraic theories. This approach ca...
The classes of real and complex C*-algebras share significant similarities with the class of groups,...
summary:We present some novel classification results in quasigroup and loop theory. For quasigroups ...
summary:We investigate the situation when the inner mapping group of a commutative loop is of order ...
summary:We consider the question of which loops are capable of expressing arbitrary Boolean function...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
We contribute to a recent research program which aims at revisiting the study of the complexity of w...