Hierarchies in classes of program schemes

DOI10.1093/logcom/9.6.915zbMath0945.68076OpenAlexW2136302019MaRDI QIDQ4943505

Iain A. Stewart, S. R. Chauhan, Argimiro Arratia Quesada

Publication date: 16 March 2000

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/5734/1/5734.pdf

zbMATH Keywords

descriptive complexity theorytransitive closure logic

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (4)

Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures ⋮ Program Schemes with Deep Pushdown Storage ⋮ On the power of deep pushdown stacks ⋮ Program schemes, arrays, Lindström quantifiers and zero-one laws

This page was built for publication: Hierarchies in classes of program schemes