Automaton logic (Q1916271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Automaton logic |
scientific article; zbMATH DE number 896376
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automaton logic |
scientific article; zbMATH DE number 896376 |
Statements
Automaton logic (English)
0 references
13 January 1997
0 references
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.
0 references
Moore automata
0 references
Mealy automata
0 references
propositional calculus
0 references
experimentally decidable propositions
0 references
partition logic
0 references
Boolean algebras
0 references
