2000 character limit reached
Partition Logics, Orthoalgebras and Automata
Published 8 Jun 2018 in quant-ph | (1806.04271v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.