Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0609209

Contexts in quantum, classical and partition logic

Karl Svozil

Published Sep 27, 2006• 6 citations
arXivHTMLPDF

Abstract

Contexts are maximal collections of co-measurable observables "bundled together" to form a "quasi-classical mini-universe." Different notions of contexts are discussed for classical, quantum and generalized urn-automaton systems.
DOI
10.48550/arxiv.quant-ph/0609209

Related papers

On generalized probabilities: correlation polytopes for automaton logic and generalized urn models, extensions of quantum mechanics and parameter cheats

Karl Svozil

Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the Cartesian and polar decomposition of arbitrary normal operators and the possibility to operationalize the corresponding observables. Thereby we review and emphasize the use of observables which maximally represent the context. (ii) In the second part, we discuss Pitowsky polytopes for automaton logic as well as for generalized urn models and evaluate methods to find the resulting Boole-Bell type (in)equalities. (iii) Finally, so-called ``parameter cheats'' are introduced, whereby parameters are transformed bijectively and nonlinearly in such a way that classical systems mimic quantum correlations and vice versa. It is even possible to introduce parameter cheats which violate the Boole-Bell type inequalities stronger than quantum ones, thereby trespassing the Tsirelson limit. The price to be paid is nonuniformity.

arXiv:quant-ph/0012066•Dec 14, 2000•3 citations

Contexts in Quantum, Classical and Partition Logic

Karl Svozil

Elsevier eBooks•Jan 1, 2009•29 citations

Partition Logics, Finite Automata and Generalized Urn Models

Karl Svozil

Complementarity was first encountered in quantum mechanics. In what follows we shall present finite deterministic models featuring complementarity. The type of complementarity discussed in this chapter grew out of an attempt to understand quantum complementarity by some finite, deterministic, quasi-classical (automaton) model.

Fundamental theories of physics•Jan 1, 2018•0 citations

Experimental contextuality of quantum and classical systems

Aonan Zhang, Lijian Zhang, Brian J. Smith

Contextuality of quantum and classical systems is examined. Differing definitions of events result in a range of violations of non-contextual hidden-variable models. This highlights classical-correlation resources and the quantum-classical divide.

Frontiers in Optics•Jan 1, 2017•0 citations

The Logic of Partitions and Partition Logics: Ore's Correspondence, Contextual Pasting, and Direct-Sum Decompositions

Karl Svozil

The term ``partition logic'' denotes two constructions at different levels. In automaton and generalized-urn models, selected partitions generate Boolean event algebras whose contextwise union forms a concrete pasted event structure; in Ellerman's framework, whole partitions are classifications governed by refinement and partition operations. For a finite set $U$, Ore's correspondence maps each generator $π$ to its Boolean algebra $\BA(π)$, but it neither identifies the pasted carrier with $\Part(U)$ nor makes pasting a partition operation. It yields $\BA(π\wedgeσ)=\BA(π)\cap\BA(σ)$ and $\BA(π\veeσ)=\langle\BA(π)\cup\BA(σ)\rangle_{\rm BA}$, where $\langle\cdot\rangle_{\rm BA}$ denotes Boolean-algebra generation. Thus meet captures the common event algebra, whereas join gives the ambient Boolean closure. Chinese-lantern, Firefly, and triangular examples distinguish shared events, atomic intertwining, and inherited concrete order. Ellerman's direct-sum decompositions (DSDs) provide a vector-space analogue: component projections of an orthogonal DSD resolve the identity and encode exclusive outcomes, but its components are not equivalence classes of vectors. Gleason and Kochen--Specker applications require globally context-consistent valuations on those projections.

quant-pharXiv:2608.08931•Aug 11, 2026•0 citations

Complementarity in Social Measurement: A Partition-Logic Approach

Karl Svozil

Partition logics -- non-Boolean event structures obtained by pasting Boolean algebras -- provide a natural language for situations in which a system has a definite latent state but can be accessed and resolved only through mutually incompatible coarse-grained modes of observation. We show that this structure arises in a range of social-science settings by constructing six explicit examples from personnel assessment, survey framing, clinical diagnosis, espionage coordination, legal pluralism, and organizational auditing. For each case we identify the latent state space, the observational contexts as partitions, and the shared atoms that intertwine contexts, yielding instances of the $L_{12}$ bowtie, triangle, pentagon, and automaton partition logics. These examples make precise a notion of social complementarity: different modes of inquiry can be incompatible even though the underlying system remains fully value-definite. Complementarity in this sense does not entail contextuality or ontic indeterminacy. We further compare the classical probabilities generated by convex mixtures of dispersion-free states with the quantum-like Born probabilities available when the same exclusivity graph admits a faithful orthogonal representation. The framework thus separates logical structure from probabilistic realization and suggests empirically testable benchmarks for quantum-cognition models.

arXiv:2603.28818•Mar 28, 2026•0 citations
Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the Cartesian and polar decomposition of arbitrary normal operators and the possibility to operationalize the corresponding observables. Thereby we review and emphasize the use of observables which maximally represent the context. (ii) In the second part, we discuss Pitowsky polytopes for automaton logic as well as for generalized urn models and evaluate methods to find the resulting Boole-Bell type (in)equalities. (iii) Finally, so-called ``parameter cheats'' are introduced, whereby parameters are transformed bijectively and nonlinearly in such a way that classical systems mimic quantum correlations and vice versa. It is even possible to introduce parameter cheats which violate the Boole-Bell type inequalities stronger than quantum ones, thereby trespassing the Tsirelson limit. The price to be paid is nonuniformity.
The term ``partition logic'' denotes two constructions at different levels. In automaton and generalized-urn models, selected partitions generate Boolean event algebras whose contextwise union forms a concrete pasted event structure; in Ellerman's framework, whole partitions are classifications governed by refinement and partition operations. For a finite set UUU, Ore's correspondence maps each generator πππ to its Boolean algebra $\BA(π)$, but it neither identifies the pasted carrier with $\Part(U)$ nor makes pasting a partition operation. It yields $\BA(π\wedgeσ)=\BA(π)\cap\BA(σ)$ and $\BA(π\veeσ)=\langle\BA(π)\cup\BA(σ)\rangle_{\rm BA}$, where ⟨⋅⟩BA\langle\cdot\rangle_{\rm BA}⟨⋅⟩BA​ denotes Boolean-algebra generation. Thus meet captures the common event algebra, whereas join gives the ambient Boolean closure. Chinese-lantern, Firefly, and triangular examples distinguish shared events, atomic intertwining, and inherited concrete order. Ellerman's direct-sum decompositions (DSDs) provide a vector-space analogue: component projections of an orthogonal DSD resolve the identity and encode exclusive outcomes, but its components are not equivalence classes of vectors. Gleason and Kochen--Specker applications require globally context-consistent valuations on those projections.
Partition logics -- non-Boolean event structures obtained by pasting Boolean algebras -- provide a natural language for situations in which a system has a definite latent state but can be accessed and resolved only through mutually incompatible coarse-grained modes of observation. We show that this structure arises in a range of social-science settings by constructing six explicit examples from personnel assessment, survey framing, clinical diagnosis, espionage coordination, legal pluralism, and organizational auditing. For each case we identify the latent state space, the observational contexts as partitions, and the shared atoms that intertwine contexts, yielding instances of the L12L_{12}L12​ bowtie, triangle, pentagon, and automaton partition logics. These examples make precise a notion of social complementarity: different modes of inquiry can be incompatible even though the underlying system remains fully value-definite. Complementarity in this sense does not entail contextuality or ontic indeterminacy. We further compare the classical probabilities generated by convex mixtures of dispersion-free states with the quantum-like Born probabilities available when the same exclusivity graph admits a faithful orthogonal representation. The framework thus separates logical structure from probabilistic realization and suggests empirically testable benchmarks for quantum-cognition models.