Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$ (Q5386211): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008235772 / rank | |||
Normal rank | |||
Latest revision as of 20:05, 19 March 2024
scientific article; zbMATH DE number 5265802
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$ |
scientific article; zbMATH DE number 5265802 |
Statements
Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$ (English)
0 references
22 April 2008
0 references
finite model theory
0 references
circuit complexity
0 references
semigroup theory
0 references
