The functional dimension of inductive definitions

DOI10.1016/0304-3975(92)90153-7zbMath0780.68091OpenAlexW2068782773MaRDI QIDQ1193414

Michel de Rougemont

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90153-7

zbMATH Keywords

shortest pathsecond-order logicexpressive powerfunctional dimensionsuccessor relationstratified logic programsfinite-valued graphsinductive querylanguage of iterated inductive definitions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic programming (68N17) Inductive definability (03D70)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The expressive power of stratified logic programs
• Elementary induction on abstract structures
• Structure and complexity of relational queries
• On formalised computer programs
• Undecidable optimization problems for database logic programs
• Reachability is harder for directed than for undirected finite graphs
• Second-order and Inductive Definability on Finite Structures
• Monadic generalized spectra
• A Transformation System for Developing Recursive Programs

This page was built for publication: The functional dimension of inductive definitions