This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
- 203 views
- 243 downloads
Six Problems in Translational Equivalence
-
- Author(s) / Creator(s)
-
I wish to first formulate a criterion according to which two systems of logic might be said to be \"really the same system\" in spite of their having different vocabulary — especially where the difference is in the logical operators each has. One way of doing this might be to show that the theorems of the two systems are validated by precisely the same structures ; but I am here interested in a more \"syntactic\" test for this. On an intuitive level, my desires could be expressed by saying that I want to be able to translate one system into the other, preserving theoremhood. For this reason I call it \"translational equivalence\" between the two systems.
-
- Date created
- 1984
-
- Subjects / Keywords
-
- Type of Item
- Article (Published)
-
- License
- © 1984 Pelletier, F.J. This version of this article is open access and can be downloaded and shared. The original author(s) and source must be cited.