Automaton logic
The main contribution of the paper is the investigation of the propositional calculus for automata of Moore or Mealy type. It is shown that the set of the experimentally decidable propositions forms in this case a partition logic, i.e., it can be seen as the ``pasting'' of a family of Boolean algebras. The analogies with quantum mechanics are also discussed.
scientific article; zbMATH DE number 896376
scientific article