The problem of finite axiomatizability for strongly minimal graph theories (Q803149)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The problem of finite axiomatizability for strongly minimal graph theories |
scientific article; zbMATH DE number 4200232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The problem of finite axiomatizability for strongly minimal graph theories |
scientific article; zbMATH DE number 4200232 |
Statements
The problem of finite axiomatizability for strongly minimal graph theories (English)
0 references
1989
0 references
finite axiomatizability
0 references
strongly minimal
0 references
graph theories
0 references
groups that act transitively on graphs of bounded valency
0 references
finitely-axiomatizable theories
0 references
0.9056141972541808
0 references
0.734591543674469
0 references
0.7194198369979858
0 references
0.7188844680786133
0 references
