Automaton logic (Q1916271)

From MaRDI portal
Revision as of 04:27, 7 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58620713, #quickstatements; #temporary_batch_1704597940110)
scientific article
Language Label Description Also known as
English
Automaton logic
scientific article

    Statements

    Automaton logic (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references