scientific article; zbMATH DE number 3845566

zbMATH Open0533.03022MaRDI QIDQ3315499FDOQ3315499

Authors: Harry R. Lewis 

Publication date: 1983

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cited In (11)

• Title not available (Why is that?)
• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
• Title not available (Why is that?)
• Exotic quantifiers, complexity classes, and complete problems
• On the combinatorial and algebraic complexity of quantifier elimination
• Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
• Complexity of quantifier elimination in the theory of ordinary differential equations
• The Complexity of Counting Quantifiers on Equality Languages
• Title not available (Why is that?)
• The Complexity of Enriched Mu-Calculi
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency

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