scientific article; zbMATH DE number 4049005

MaRDI QIDQ3785901zbMATH OpenFDO

Authors Jerzy Tiuryn

Publication date 1986

zbMATH Keywords

complexity theorycomputational power of programming languagesdata structureshigher-order arrayslogics of programsnondeterminismstacks

Mathematics Subject Classification ID

Logic in computer science (03B70) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3880106
• Some relationships between logics of programs and complexity theory
• scientific article; zbMATH DE number 4028877
• Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
• The expressive power of higher-order types or, life without CONS

Cited in

(5)

• On the expressive power of finitely typed and universally polymorphic recursive procedures
• Characterizing complexity classes by higher type primitive recursive definitions
• Characterizing complexity classes by general recursive definitions in higher types
• A Refinement of the μ-measure for Stack Programs
• Computational inductive definability

This page was built for publication:

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