1980•Studies in logic and the foundations of mathematicsRequires access

Embeddings into Finitely Generated Simple Groups Which Preserve the Word Problem

Richard J. Thompson

Open publisher page 88 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 88 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Word problem (mathematics education), Countable set, Recursively enumerable set, Recursively enumerable language, Stallings theorem about ends of groups, Mathematics, Word (group theory), Simple (philosophy)

Back to paper search Browse research topics Original source

Embeddings into Finitely Generated Simple Groups Which Preserve the Word Problem — Research Paper | ScholarLens