Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Probability in Statistics

Probability in Statistics

Probability is the likelihood of an event occurring. The term event is defined as a collection of results of a procedure. An event is a simple event when an outcome cannot be divided into simpler parts.
An example of a simple event is a coin toss. The result of a coin toss is either a head or a tail. Here, head and tail are two simple events. These two simple events make up the sample space. Further, the probability of an event occurring falls within the range of 0 to 1. The probability of an...

Pole and System Stability

Pole and System Stability

The transfer function is a fundamental concept representing the ratio of two polynomials. The numerator and denominator encapsulate the system's dynamics. The zeros and poles of this transfer function are critical in determining the system's behavior and stability.
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's...

Parseval's Theorem

Parseval's Theorem

Parseval's theorem is a fundamental concept in signal processing and harmonic analysis. It asserts that for a periodic function, the average power of the signal over one period equals the sum of the squared magnitudes of all its complex Fourier coefficients. This theorem, named after Marc-Antoine Parseval, provides a powerful tool for analyzing the energy distribution in signals.
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which...

How Data are Classified: Numerical Data

How Data are Classified: Numerical Data

Data that are countable or measurable in specific units are called numerical or quantitative data. Quantitative data are always numbers. Quantitative data are the result of counting or measuring the attributes of a population. Amount of money, pulse rate, weight, number of people living in a town, and number of students who opt for statistics are examples of quantitative data.
Quantitative data may be either discrete or continuous. All quantitative data that take on only specific numerical...

Even and Odd Signals

Even and Odd Signals

An even signal, whether in continuous-time or discrete-time, is defined by its symmetry with its time-reversed version. Mathematically, this is represented as

Probability Laws

Probability Laws

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Implication in finite posets with pseudocomplemented sections.

Soft computing·2022

Same author

Sheffer operation in relational systems.

Soft computing·2022

Same author

Consistent posets.

Soft computing·2021

Same author

Filters and congruences in sectionally pseudocomplemented lattices and posets.

Soft computing·2021

Same author

The logic induced by effect algebras.

Soft computing·2020

Search research articles

Related Experiment Video

Updated: Oct 12, 2025

The HoneyComb Paradigm for Research on Collective Human Behavior

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

On Boolean posets of numerical events.

Dietmar Dorninger¹, Helmut Länger^1,2

¹Faculty of Mathematics and Geoinformation, Institute of Discrete Mathematics and Geometry, TU Wien, Wiedner Hauptstraße 8-10, 1040 Vienna, Austria.

Advances in Computational Intelligence

|November 22, 2021

Summary

This summary is machine-generated.

This study introduces numerical events (S-probabilities) for quantum mechanics decision-making. It explores quantum logic structures that approximate classical Boolean algebras, offering insights into physical systems.

Keywords:

Boolean poset Numerical event Quantum effects Quantum logic Set of states

More Related Videos

Observation and Analysis of Blinking Surface-enhanced Raman Scattering

Observation and Analysis of Blinking Surface-enhanced Raman Scattering

Published on: January 11, 2018

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

Related Experiment Videos

Last Updated: Oct 12, 2025

The HoneyComb Paradigm for Research on Collective Human Behavior

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

Observation and Analysis of Blinking Surface-enhanced Raman Scattering

Observation and Analysis of Blinking Surface-enhanced Raman Scattering

Published on: January 11, 2018

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

Area of Science:

Quantum Mechanics
Mathematical Physics
Quantum Logic

Background:

Physical processes often involve quantum mechanical phenomena requiring decision mechanisms based on measurement data.
Numerical events, defined as S-probabilities, provide a framework for incorporating these decision mechanisms.
The structure of S-probabilities can form a poset, representing quantum logic, which deviates from classical Boolean algebras.

Purpose of the Study:

To investigate sets of S-probabilities that closely resemble Boolean algebras.
To analyze the addition and comparison of functions within these S-probability sets.
To characterize and relate specific classes of Boolean posets of S-probabilities.

Main Methods:

Defining numerical events (S-probabilities) based on system states and event probabilities.
Ordering sets of S-probabilities to form posets, interpreted as quantum logic.
Studying deviations from Boolean algebras by examining function operations within these posets.

Main Results:

Characterization of specific classes of Boolean posets of S-probabilities.
Establishment of relationships between these Boolean posets.
Derivation of descriptions of these structures based on sets of states.

Conclusions:

The study provides a mathematical framework for understanding decision mechanisms in quantum systems using S-probabilities.
It elucidates the relationship between quantum logic and classical Boolean algebras by analyzing near-Boolean structures.
The findings contribute to the theoretical understanding of quantum systems and their logical underpinnings.