Burroughs Truth-Function Evaluator(ID:3973/bur005)

Logical evaluator system 

Burks, Warren and Wright. Logical evaluator system

Burroughs Truth-Function Evaluator
References:
  • Burks, Arthur W.; Warren, Don; and Wright, Jesse B. "An analysis of a logical machine using parenthesis-free notation" pp53-57 view details
          in Mathematical Tables and Other Aids to Computation 8 view details
  • William Miehle: Burroughs Truth Function Evaluator view details DOI Extract: Truth functions
    The Burroughs truth function evaluator evaluates truth functions and formulas composed of a string of such functions. Six different functions can be directly evaluated. They are:
    N--negation, not
    A--alteration, inclusive disjunction (or); either or both
    R--exclusive disjunction, material inequivalence, one and only one
    K---conjunction, and, both
    E--bi-conditional, material equivalence, compare, if and only if
    C---conditional; material implication; implicative; if, then
    [...]
    The formula must be expressed in Lukasiewicz' parenthesis-free notation. In this notation, a formula is written and scanned from right to left, and instead of writing an operator between the variables such as (p dot q), it is written to the left (Kpq). Its advantages are that no parentheses are needed and that it can be mechanized as will be shown.
          in [ACM] JACM 4(2) April 1957 view details