Analogues of Rice's theorem for semantic classes of propositions

DOI10.1007/BF01980248zbMATH Open0777.03011OpenAlexW1993095117MaRDI QIDQ1803023FDOQ1803023

Authors: 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

Recommendations

• A restricted analog of the third level of Rice's theorem for semantic classes of sentences
• More intensional versions of Rice's theorem
• The intensional content of Rice's theorem
• Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
• A second step towards complexity-theoretic analogs of Rice's Theorem

zbMATH Keywords

complexityexpressibilityrecursively axiomatizable theorysemantic classes of propositions

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Title not available (Why is that?)

Cited In (9)

• More intensional versions of Rice's theorem
• Erratum to ``The Ricean objection: An analogue of Rice's theorem for first-order theories.
• A finitary realizable list of properties
• The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
• Title not available (Why is that?)
• A.D. Taimanov and model theory in Kazakhstan
• The intensional content of Rice's theorem
• Rice and Rice-Shapiro theorems for transfinite correction grammars
• First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories

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

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