Most general first order theorems are not recursively enumerable

DOI10.1016/0304-3975(94)00229-CzbMath0873.68118MaRDI QIDQ672461

Gerhard Schurz

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

modal operators\(\varepsilon\)-substitution

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A model for belief revision
• The converse principal type-scheme theorem in lambda calculus
• Principal types of BCK-lambda-terms
• How far can Hume's is-ought thesis be generalized? An investigation in alethic-deontic modal predicate logic
• Relevant consequence and empirical inquiry
• Principal type-schemes and condensed detachment