This project studied whether a digital interlocking which had been programmed with ladder logic (Boolean program) would obey generic safety properties. This was carried out by translating the ladder logic into an alternate representation and applying various techniques to allow specification of safety properties. Finally, a proof engine was used to formally verify if these properties were fulfi...

some inductive inferences are as probable in relation to the premisses as non-sceptics think they are. But the premisses of my proofs were, principally, statements of logical probability; and propositions of this kind, or at least the published systems of propositions of this kind, lie under certain definite objections from philosophers, as well as under a less definite but even more damaging s...

1 Formal Logic with Conceptual Graphs 3 Frithjof Dau 1.

After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell’s Principia Mathematica with the axiom of infinity but without the axiom of reducibility. 1 Historical introduction After discovering the inconsistency in Frege’s Grundgesetze der Arithmetik, Russell proposed two changes: first, dropping the assumption that to every h...