scientific article; zbMATH DE number 3561331

MaRDI QIDQ4133967zbMATHFDO

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)

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

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)