Low Keystroke Formal Languages

P.H. Nidditch. Introductory Formal Logic of Mathematics. University Tutorial Press: London, 1957.

Enticing introduction promises that followers will blaze fruitful trails in mathematics. At any rate, those who try it out will find it easier to type than Benson Mates’s L.

The book introduces several languages, but this is the slim union of their alphabets: A, C, E, J, K, N, I, U, - +, =, P, S, ‘, ., ^, &, cop, cor, f, fgr, fin, fk, fon, g, gr, map, pm, tri, (superscript) -1, (superscript) .., :., (, b, c, h, k, m, u, x, y, z, 1, 2, 3, 4, 5, 6.... (A special character map with a slashed 0 and a slashed 1 is occasionally necessary.) There are no parentheses, brackets, braces; ambiguities are prevented by the use of reverse polish notation.

Sounds like FalseLanguage! oh? Everything that uses RPN sounds like False? HP calculators? That and the single character names. Meant in jest, of course.

See MathematicalNotation


EditText of this page (last edited June 24, 2004) or FindPage with title or text search