scientific article; zbMATH DE number 3561331

MaRDI QIDQ4133967zbMATH OpenFDO

Authors Albert R. Meyer

Publication date 1975

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25)

Cited in

(12)

• An analysis of the Core-ML language: Expressive power and type reconstruction
• A uniform method for proving lower bounds on the computational complexity of logical theories
• The typed lambda-calculus is not elementary recursive
• The most nonelementary theory
• On computational complexity of Prolog programs
• Compositional complexity of Boolean functions
• The recognition complexity of decidable theories
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Parallel beta reduction is not elementary recursive
• Complexity hierarchies beyond elementary
• (Optimal) duplication is not elementary recursive
• A simple proof of a theorem of Statman

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 Q4133967)