My question is in regard to a problem (albeit a simple one) that I ran into reading Tarski's paper "Concept of Truth in Formalized Languages".
On page 159 Tarski states:
(5) for all p, ‘p' is a true sentence if and only if p.
From what I understand, this is meant to be a generalization of a prior example he gave earlier as case (3) which was:
(3) ‘it is snowing' is a true sentence if and only if it is snowing
Which in turn was meant to be a specification of case (2), which stated:
(2) x is a true sentence if and only if p.
In which x is the 'name' of the sentence p. Here I have what one might regard as a trivial question, that being, is case (2) not already a generalization of case (3)? If that is the case, what is the point of case (5)? To make the generalization of (3) more rigorous?
A second question I have is in regards to case (5), Tarski states about case (5):
(5) for all p, ‘p' is a true sentence if and only if p.
But the above sentence could not serve as a general definition of the expression 'x is a true sentence’ because the totality of possible substitutions for the symbol x is here restricted to quotation-mark names. In order to remove this restriction we must have recourse to the well-known fact that to every true sentence (and generally speaking to every sentence) there corresponds a quotation-mark name which denotes just that sentence. With this fact in mind we could try to generalize the formulation (5), for example, in the following way:
(6) for all x, x is a true sentence if and only if, for a certain p, x is identical with 'p' and p.
If I am understanding his dilemma correctly, he is pointing out the fact that if the statement 'x is a true sentence' is presented in (5), the problem that arises is that you'll have a non-sensical end statement since x can only symbolize a quotation mark name, to illustrate:
[''it is snowing'' is a true sentence iff 'it is snowing' is a true sentence]
whereas what we want is:
['it is snowing' is a true sentence iff it is snowing is a true sentence]
The thing I do not understand here is how case (6) solves the problem he mentioned about case (5)? What is case (6) saying?
Furthermore, why can't Tarski simply apply functions to p in order to avoid the problems he later mentions about using the quotation marks in the manner it is used in case (5) and to remedy the problem he mentioned above about nested quotation mark names? For example, why can he not simply formulate (5) as:
If p is not a quotation mark name: For all p, p is a true sentence if and only if X(p). Else: For all p, Q(p) is a true sentence if and only if X(p).
In which Q(p) is a function that adds a quotation string before p and at the end of p, and X(p) would remove all quotation strings from p (as the quotation mark name would in essence simply be a variable in place of the actual sentence).
An easy way to represent this would be with a small snippet of python code that goes as follows:
p = "'it is snowing'"
Xp = p.replace("'", "")
Qp = "'" + p + "'"
if "'" in p:
print (p, "is a true sentence iff", Xp)
else:
print (Qp, "is a true sentence iff", Xp)
Resulting in the statement ['it is snowing' is a true sentence iff it is snowing] regardless of if you put in ['it is snowing'] or [its snowing] as p.
This seems to avoid the problem of nested quotation mark names and the problem of transforming the quotation marks (themselves) into functions. Is there something I am missing, or am I completely misunderstanding Tarski? Is there something I need to familiarize myself with before diving into Tarksi? He seems almost impossible to comprehend (so many of his sentences can have double meanings and it seems as if there are a lot of inferences he expects you to make) compared to other writers of his school (such as Lukasiewicz).
Anyways, thank you for taking the time to read or answer this question, any help or guidance would be appreciated - Thank you