A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths

Both in Kripke's Theory of Truth KTT [8] and Russell's Ramified Type Theory RTT [16, 9] we are confronted with some hierarchy. In RTT, we have a double hierarchy of orders and types. That is, the class of propositions is divided into different orders where a propositional function can only depend on objects of lower orders and types. Kripke on the other hand, has a ladder of languages where the truth of a proposition in language Ln can only be made in Lm where m)n. Kripke finds a fixed point for his hierarchy (something Russell does not attempt to do). We investigate in this paper the similarities of both hierarchies: At level n of KTT the truth or falsehood of all order-n-propositions of RTT can be established. Moreover, there are order-n-propositions that get a truth value at an earlier stage in KTT. Furthermore, we show that wrr is more restrictive than KTT, as some type restrictions are not needed in KTT and more formula., can be expressed in the latter. Looking back at the double hierarchy of Russell, Ramsey [11] and Hilbert and Ackermann [7] considered the orders to cause the restrictiveness, and therefore removed them. This removal resulted in Church's Simple Type Theory STT [1] We show however that orders in RTT correspond to levels of truth in KTT. Hence, KTT can be regarded as the dual of STT where types have been removed and orders are maintained. As RTT is more restrictive than KTT, we can conclude that it is the combination of types and orders that was the restrictive factor in RTT.

[1]  G. B. M..  Principia Mathematica , 1911, Nature.

[2]  Richard Montague,et al.  The Proper Treatment of Quantification in Ordinary English , 1973 .

[3]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[4]  R. H.,et al.  The Principles of Mathematics , 1903, Nature.

[5]  Gerard Zwaan,et al.  A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms , 1996, Sci. Comput. Program..

[6]  Solomon Feferman,et al.  Toward useful type-free theories. I , 1984, Journal of Symbolic Logic.

[7]  Michel A. Reniers,et al.  An Algebraic Semantics of Basic Message Sequence Charts , 1994, Comput. J..

[8]  P. Niebert,et al.  On the connection of partial order logics and partial order reduction methods , 1995 .

[9]  Orna Grumberg,et al.  Abstract interpretation of reactive systems : preservation of CTL* , 1995 .

[10]  Ron Selj.  A New Method for Integrity Constraint Checking in Deductive Databases , 1994 .

[11]  Saul A. Kripke,et al.  Outline of a Theory of Truth , 1975 .

[12]  J. Heijenoort.  From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 , 1967 .

[13]  B. Russell.  Mathematical Logic as Based on the Theory of Types , 1908 .

[14]  Alfred Tarski,et al.  Der Wahrheitsbegriff in den formalisierten Sprachen , 1935 .

[15]  Twan Laan,et al.  A formalization of the ramified type theory , 1994 .

[16]  Jan Peleska,et al.  A comparison of Ward & Mellor's transformation schema with state & activitycharts , 1994 .

[17]  Reniers,et al.  Empty interworkings and refinement semantics of interworkings revised , 1995 .

[18]  Bruce W. Watson.  An introduction to the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .

[19]  Jj Vereijken,et al.  Fischer's protocol in timed process algebra , 1994 .

[20]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[21]  H. B. Curry,et al.  Combinatory Logic, Volume I. , 1961 .

[22]  Fairouz Kamareddine,et al.  Refining Reduction in the Lambda Calculus , 1995, J. Funct. Program..

[23]  L. M.-T..  Grundzüge der theoretischen Logik , 1929, Nature.

[24]  Gottlob Frege,et al.  Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens , 1879 .