Analogues of Rice's theorem for semantic classes of propositions

DOI10.1007/BF01980248zbMath0777.03011OpenAlexW1993095117MaRDI QIDQ1803023

Mikhaĭl G. Peretyat'kin

Publication date: 29 June 1993

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

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

zbMATH Keywords

complexityexpressibilityrecursively axiomatizable theorysemantic classes of propositions

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (2)

First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories ⋮ A.D. Taimanov and model theory in Kazakhstan

Cites Work

• Classes of Recursively Enumerable Sets and Their Decision Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analogues of Rice's theorem for semantic classes of propositions