scientific article

zbMATH Open0622.68035MaRDI QIDQ3759934FDOQ3759934

Author name not available (Why is that?)

Publication date: 1987

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

zbMATH Keywords

PTIMEcomplexity measurelower bound resultsextension of first order logicnondeterministic inductionnondeterministic inductive operator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical first-order logic (03B10) Abstract data types; algebraic specification (68Q65)

Cited In (5)

• Computation on structures. Behavioural theory, logic, complexity
• Title not available (Why is that?)
• Context-sensitive transitive closure operators
• Title not available (Why is that?)
• Fixed-point Logics with Nondeterministic Choice

   Recommendations

• Title not available (Why is that?) 👍 👎
• Fixed-point Logics with Nondeterministic Choice 👍 👎
• Monotonicity and the Expressibility of NP Operators 👍 👎
• The expressive power of fixed-point logic with counting 👍 👎
• Infinitary logic and inductive definability over finite structures 👍 👎

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