| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118916 | Annals of Pure and Applied Logic | 2005 | 29 Pages |
Abstract
A theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfully interpretable. In this paper we give a characterization of trustworthiness. We provide a simple proof of Friedman's Theorem that finitely axiomatized, sequential, consistent theories are trustworthy. We provide an example of a theory whose schematic predicate logic is complete Î 20.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Albert Visser,