Inductive definitions over finite structures

DOI10.1016/0890-5401(90)90006-4zbMath0718.03034OpenAlexW1967986305MaRDI QIDQ2639057

Daniel Leivant

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90006-4

zbMATH Keywords

finite structuresinductive closure

Mathematics Subject Classification ID

Database theory (68P15) Inductive definability (03D70)

Related Items (7)

Generalized quantifiers and pebble games on finite structures ⋮ Logics capturing relativized complexity classes uniformly ⋮ Datalog extensions for database queries and updates ⋮ Computing on structures ⋮ A restricted second order logic for finite structures ⋮ The alternating fixpoint of logic programs with negation ⋮ A restricted second order logic for finite structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Henkin quantifiers and complete problems
• Fixed-point extensions of first-order logic
• Why not negation by fixpoint?
• Elementary induction on abstract structures
• Model theory
• Relational queries computable in polynomial time
• Monotone versus positive
• Abstract First Order Computability. I

This page was built for publication: Inductive definitions over finite structures