Metalinear recursive schemas on marked trees

MaRDI QIDQ797277zbMATH OpenFDO

Authors L. P. Lisovik

Publication date 1983

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

equivalencedecidabilityinclusionfinite-turning countersmetalinear unary recursive schemas

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Abstract data types; algebraic specification (68Q65)

Recommendations

• On model-theoretic tree properties
• Model complete theories of trees
• scientific article; zbMATH DE number 5529981
• scientific article; zbMATH DE number 1136113
• scientific article; zbMATH DE number 475422
• A decidable class of nested iterated schemata
• Decidable properties of monadic recursive schemas with a depth parameter
• Some model theory for generalized trees
• Model theory of \(\mathbb{R}\)-trees
• The power of Tarski's relation algebra on trees

This page was built for publication: Metalinear recursive schemas on marked trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797277)