The number of finitely axiomatizable completions

DOI10.1007/BF00970173zbMath0781.03020OpenAlexW2016283247MaRDI QIDQ1814398

S. S. Zaurbekov

Publication date: 25 June 1992

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00970173

zbMATH Keywords

finitely axiomatizable theoriesalgorithmic complexity of classes of sentencessmall hierarchy of arithmetical sets

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Hierarchies of computability and definability (03D55)

Related Items (1)

A restricted analog of the third level of Rice's theorem for semantic classes of sentences

Cites Work

• Unnamed Item
• A note on the Entscheidungsproblem

This page was built for publication: The number of finitely axiomatizable completions