On the public citation graph

Partition logics of automata

https://doi.org/10.1007/bf02727427
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/mana.19911540113openalex-snapshot
The Pasting Constructions for Orthomodular Posets
inferredcites →https://doi.org/10.1007/bf00671321openalex-snapshot
Automata simulating quantum logics
inferredcites →https://doi.org/10.1007/bf02085960openalex-snapshot
Computational complementarity
inferredcites →https://doi.org/10.1016/s0304-0208(08)73817-9openalex-snapshot
Orthomodular Lattices
inferredcites →https://doi.org/10.1142/1524openalex-snapshot
Randomness and Undecidability in Physics
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
inferredcites →https://doi.org/10.2307/1968621openalex-snapshot
The Logic of Quantum Mechanics
inferredcites →https://doi.org/10.2307/2964500openalex-snapshot
Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4471-0313-4_19openalex-snapshot
Quantum Information: The New Frontier
inferred← citeshttps://doi.org/10.1007/978-3-319-70815-7openalex-snapshot
Physical (A)Causality: Determinism, Randomness and Uncaused Events
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_9openalex-snapshot
Computational Complementarity for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-94-017-3327-4_6openalex-snapshot
A Constructivist Manifesto for the Physical Sciences — Constructive Re-Interpretation of Physical Undecidability
inferred← citeshttps://doi.org/10.1007/bf00676288openalex-snapshot
Automaton partition logic versus quantum logic
inferred← citeshttps://doi.org/10.1007/bf02055507openalex-snapshot
Set theory and physics
inferred← citeshttps://doi.org/10.1007/bf02084959openalex-snapshot
Empirical logic of finite automata: Microstatements versus macrostatements
inferred← citeshttps://doi.org/10.1007/bf02302381openalex-snapshot
Automaton logic
inferred← citeshttps://doi.org/10.1007/bf02302454openalex-snapshot
Product of partition logics, orthoalgebras, and automata
inferred← citeshttps://doi.org/10.1007/bf02435752openalex-snapshot
Physical versus computational complementarity. I
inferred← citeshttps://doi.org/10.1007/bf02849839openalex-snapshot
Effective quantum observables
inferred← citeshttps://doi.org/10.1007/s00500-019-04425-1openalex-snapshot
Faithful orthogonal representations of graphs from partition logics
inferred← citeshttps://doi.org/10.1016/b978-044452870-4/50037-6openalex-snapshot
Quantum logic and automata theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00039-0openalex-snapshot
Deterministic automata simulation, universality and minimality
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00221-7openalex-snapshot
Finite nondeterministic automata: Simulation and minimality
inferred← citeshttps://doi.org/10.1016/s0960-0779(98)00300-2openalex-snapshot
Computational complementarity and shift spaces
inferred← citeshttps://doi.org/10.1016/s1355-2198(97)00028-2openalex-snapshot
Analogues of quantum complementarity in the theory of automata
inferred← citeshttps://doi.org/10.1023/a:1018862730956openalex-snapshot
Embedding Quantum Universes in Classical Ones
inferred← citeshttps://doi.org/10.1023/a:1026646229896openalex-snapshot
Greechie Diagrams of Small Quantum Logics with Small State Spaces
inferred← citeshttps://doi.org/10.1063/1.531710openalex-snapshot
Greechie diagrams, nonexistence of measures in quantum logics, and Kochen–Specker-type constructions
inferred← citeshttps://doi.org/10.1080/02604027.1997.9972653openalex-snapshot
Information and the complementarity game
inferred← citeshttps://doi.org/10.1109/grc.2005.1547240openalex-snapshot
A theory of computation based on quantum logic (I)
inferred← citeshttps://doi.org/10.3390/e22060602openalex-snapshot
What Is So Special about Quantum Clicks?
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04271openalex-snapshot
Partition Logics, Orthoalgebras and Automata
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.