Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories|
|Abstract:||We propose here an extension of Rice's theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order theories and P is non-tricial over the set of finitely axiomatizable theories (i.e., P holds for some, but not all theories), then P is undecidable. This not only means that the problem of deciding properties of first-order theories is as hard as the problem of deciding properties about languages accepted by Turing machines, but also offers a general setting for proving several undecidability results in first-order theories.|
|Editor:||Oxford Univ Press|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.