Partition Logics, Orthoalgebras and Automata
Anatolij Dvurecenskij, Sylvia Pulmannova, Karl Svozil
TL;DR
This paper explores the structure of certain non-Boolean models, specifically partition logics derived from automata, to understand their algebraic properties and classical realizations.
Contribution
It introduces a novel analysis of partition logics associated with Moore and Mealy automata within the framework of orthoalgebras.
Findings
Identification of classical realizations of non-Boolean models
Characterization of orthoalgebras in automata-based logics
Insights into the propositional structure of automata
Abstract
We investigate the orthoalgebras of certain non-Boolean models which have a classical realization. Our particular concern will be the partition logics arising from the investigation of the empirical propositional structure of Moore and Mealy type automata.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Computability, Logic, AI Algorithms