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

Springer eBooks

The Structure of the Propositional Calculus of a Physical Theory

Franz W. Kamber

Published Jan 1, 1975• 3 citations
Publisher
DOI
10.1007/978-94-010-1795-4_13

Related papers

A modal propositional calculus for quantum facts and dynamical theories

Harald Atmanspacher A, F.R. Krueger, H. Scheingraber

Lecture notes in computer science•Jan 1, 1991•3 citations

Quantum theory as a theory in a classical propositional calculus

Othman Qasim Malhas

International Journal of Theoretical Physics•Sep 1, 1992•3 citations

Semantics of Physical Theories

Evert Willem Beth

Springer eBooks•Jan 1, 1961•72 citations

Foundations of a quantum probability theory

M. D. Srinivas

Statistical physical theories are frequently formulated in terms of probabilistic structures founded on a ’’logic of experimentally verifiable propositions.’’ It is argued that to each experimentally verifiable proposition there corresponds an experimental procedure which, in general, alters the state of the system, and is completely characterized by a ’’measurement transformation’’ or ’’operation.’’ An analysis of the relations among these experimental procedures leads us to a ’’logic of operations’’ which is quite different from the ’’lattice theoretic logics’’ that are often considered (albeit inadequate empirical justification), as models for the calculus of experimentally verifiable propositions of quantum theory. It is seen that the quantum probability theory based on the logic of operations provides the proper mathematical framework for discussing the statistics of successive observations in quantum theory. We also indicate how a theory of quantum stochastic processes can be formulated in a way similar to the Kolmogorov formulation of the classical theory.

Journal of Mathematical Physics•Aug 1, 1975•50 citations

Physical Theories as Algebraic Systems

Peter Bongaarts

Springer eBooks•Dec 1, 2014•1 citation

Logical Structures Arising in Quantum Theory

Simon Kochen, Ernst P. Specker

The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooks•Jan 1, 1990•82 citations
Statistical physical theories are frequently formulated in terms of probabilistic structures founded on a ’’logic of experimentally verifiable propositions.’’ It is argued that to each experimentally verifiable proposition there corresponds an experimental procedure which, in general, alters the state of the system, and is completely characterized by a ’’measurement transformation’’ or ’’operation.’’ An analysis of the relations among these experimental procedures leads us to a ’’logic of operations’’ which is quite different from the ’’lattice theoretic logics’’ that are often considered (albeit inadequate empirical justification), as models for the calculus of experimentally verifiable propositions of quantum theory. It is seen that the quantum probability theory based on the logic of operations provides the proper mathematical framework for discussing the statistics of successive observations in quantum theory. We also indicate how a theory of quantum stochastic processes can be formulated in a way similar to the Kolmogorov formulation of the classical theory.
The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.