Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
3 answers
872 views

An element $g$ in a group such that neither $g=1$ nor $g\ne 1$ can be proved.

Edited (this question contains two versions of a similar question) Is there some finitely presented group $G$ generated by $g_1,...,g_n$ such that there is an element $g\in G$ expressed as a finite ...
aglearner's user avatar
  • 14.3k
4 votes
2 answers
544 views

Membership problem in monoids

What is the simplest example of a monoid with undecidable membership problem? In other words, I'm looking for a concrete monoid $S$ such that there is no algorithm which takes elements $s_1,...,s_n$ ...
dan's user avatar
  • 41
8 votes
1 answer
338 views

How bad can the recursive properties of finitely presented groups be?

Any finitely presented group naturally gives rise to an edge-labeled graph (the Cayley graph) and I am considering paths through this graph. Paths correspond to infinite sequences of generators, so ...
Aubrey da Cunha's user avatar