This means that natural language expressions such as `` A is B , '' `` A is the same as B , '' etc. are not directly represented by logical equality ; similarly , `` not '' is often not treated as logical negation ; cfXXX Hintikka ( 1985 ) .
the game of language
J Hintikka
Unless explicitly stated otherwise , we assume that formulas are expressed in a certain ( formal ) language L without equality ; the extension L ( =-RRB- of L is going to be used only in Section 5 for dealing with noun phrase references . This means that natural language expressions such as `` A is B , '' `` A is the same as B , '' etc. are not directly represented by logical equality ; similarly , `` not '' is often not treated as logical negation ; cfXXX Hintikka ( 1985 ) . All logical notions that we are going to consider , such as theory or model , will be finitary .
This means that natural language expressions such as `` A is B , '' `` A is the same as B , '' etc. are not directly represented by logical equality ; similarly , `` not '' is often not treated as logical negation ; cfXXX @@CITATION .