scientific article; zbMATH DE number 1418435

zbMATH Open0952.03067MaRDI QIDQ4941990FDOQ4941990

Authors: Alessandro Berarducci, Benedetto Intrigila 

Publication date: 7 January 2001

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

Recommendations

• Definability of combinatorial functions and their linear recurrence relations
• Some results about linear recurrence relation homomorphisms
• \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
• scientific article; zbMATH DE number 3914328
• scientific article; zbMATH DE number 23426

zbMATH Keywords

definabilitylinear recurrencematrix iterationrecursive definitions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cited In (1)

• An undecidable nested recurrence relation

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