Algorithmic problems and hierarchies of first-order languages

DOI10.1007/BF01980240MaRDI QIDQ1112803zbMATH OpenFDO

Authors Yu. M. Vazhenin

Publication date 1987

Published in Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

algebraic systemsalgorithmic problemrecursive hierarchiescritical theorieselementary language of finite signature

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Hierarchies of computability and definability (03D55)

Recommendations

• scientific article; zbMATH DE number 4055566
• scientific article; zbMATH DE number 3960994
• Matrix hierarchies of first-order languages and their applications
• First-order definable languages
• Languages, Decidability, and Complexity
• Mathematical Foundations of Computer Science 2004
• First-order approximation of algorithmic theories
• scientific article; zbMATH DE number 1001889
• scientific article; zbMATH DE number 969067
• scientific article; zbMATH DE number 3259059

Cites work

• scientific article; zbMATH DE number 3833929 (Why is no real title available?)
• scientific article; zbMATH DE number 3739824 (Why is no real title available?)
• scientific article; zbMATH DE number 3246235 (Why is no real title available?)
• scientific article; zbMATH DE number 3316928 (Why is no real title available?)
• scientific article; zbMATH DE number 3318637 (Why is no real title available?)
• scientific article; zbMATH DE number 3343706 (Why is no real title available?)
• Critical theories
• DECIDABILITY PROBLEMS OF EXTENDED THEORIES

This page was built for publication: Algorithmic problems and hierarchies of first-order languages

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