scientific article; zbMATH DE number 1272994

MaRDI QIDQ4237287zbMATH OpenFDO

Authors Thomas Quintus

Publication date 5 April 1999

zbMATH Keywords

complexity theoryfinite model theorydescriptive complexity theoryreducibilitiesoracle Turing machinesrelativized model of computationoracle setsLindström quantifiercapturing of relativized complexity classes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 1555186
• Capturing relativized complexity classes with Lindström quantifiers
• Relativized logspace and generalized quantifiers over finite ordered structures

Cited in

(6)

• scientific article; zbMATH DE number 4027448 (Why is no real title available?)
• scientific article; zbMATH DE number 1555186 (Why is no real title available?)
• Capturing complexity classes with Lindström quantifiers
• Capturing relativized complexity classes with Lindström quantifiers
• On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi
• Program schemes, arrays, Lindström quantifiers and zero-one laws

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