Hierarchies in classes of program schemes

DOI10.1093/LOGCOM/9.6.915MaRDI QIDQ4943505zbMATH OpenOpenAlexFDO

Authors S. R. Chauhan, Iain Stewart, A. A. 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)

Recommendations

• An infinite hierarchy in a class of polynomial-time program schemes
• Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
• Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
• Logical and schematic characterization of complexity classes
• Program schemes, arrays, Lindström quantifiers and zero-one laws

Cited in

(11)

• On the power of deep pushdown stacks
• On the power of built-in relations in certain classes of program schemes
• Logical and schematic characterization of complexity classes
• Program schemes, arrays, Lindström quantifiers and zero-one laws
• Hierarchical sets in mathematical programming modeling languages
• An infinite hierarchy in a class of polynomial-time program schemes
• Program Schemes with Deep Pushdown Storage
• Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
• Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
• Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
• scientific article; zbMATH DE number 1424048 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943505)