Encoding orders and trees in binary relations (Q3895443): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On universal Horn classes categorical in some infinite power / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ℵ<sub>0</sub>-categorical modules / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Elimination of quantifiers for modules / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1112/s0025579300015357 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030990536 / rank | |||
Normal rank | |||
Latest revision as of 11:48, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Encoding orders and trees in binary relations |
scientific article |
Statements
Encoding orders and trees in binary relations (English)
0 references
1981
0 references
finite trees
0 references
finite orders
0 references
stable formula
0 references
binary tree
0 references
