Causal Calculus: Primitive Aggregation under Finite Causal Access
Abstract
This note introduces a primitive aggregation operator within Causal Calculus, designed to formalize aggregation under finite causal and epistemic access. The operator does not presuppose an underlying discrete or continuous ontology. Classical summation and integration may arise only asdeclared limiting cases under additional structural assumptions
Fields of Study & Subjects
Game Theory and Voting Systems
Logic
Reasoning
and Knowledge
Bayesian Modeling and Causal Inference
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 6 January 2026
- Document type
- Preprint