scientific article; zbMATH DE number 4009811

MaRDI QIDQ3759934zbMATH OpenFDO

Authors

Publication date 1987

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)

Recommendations

• scientific article; zbMATH DE number 4008383
• 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

Cited in

(6)

• Computation on structures. Behavioural theory, logic, complexity
• Context-sensitive transitive closure operators
• scientific article; zbMATH DE number 2079031 (Why is no real title available?)
• scientific article; zbMATH DE number 3321243 (Why is no real title available?)
• Fixed-point Logics with Nondeterministic Choice
• scientific article; zbMATH DE number 4008383 (Why is no real title available?)

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)