Pages that link to "Item:Q1311973"
From MaRDI portal
The following pages link to Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973):
Displaying 4 items.
- A query language for NC (Q1376409) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
