Definability of Recursive Predicates in the Induced Subgraph Order (Q5224502): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-662-54069-5_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2557506139 / rank | |||
Normal rank | |||
Revision as of 19:23, 19 March 2024
scientific article; zbMATH DE number 7084740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Definability of Recursive Predicates in the Induced Subgraph Order |
scientific article; zbMATH DE number 7084740 |
Statements
Definability of Recursive Predicates in the Induced Subgraph Order (English)
0 references
24 July 2019
0 references
Turing machine
0 references
order theory
0 references
label graph
0 references
cardinality constraint
0 references
connectivity constraint
0 references
