Results 11 to 20 of about 506 (185)
Quantum Epistemology and Falsification [PDF]
The operational axiomatization of quantum theory in previous works can be regarded as a set of six epistemological rules for falsifying propositions of the theory.
Giacomo Mauro D’Ariano
doaj +2 more sources
Logical Structures Underlying Quantum Computing [PDF]
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
Federico Holik +3 more
doaj +2 more sources
A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains [PDF]
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al. for the class of finite labelled Markov chains.
Giorgio Bacci +3 more
doaj +1 more source
A Behavioral Foundation of Satiation and Habituation
Tastes change over time. People’s tastes are distorted through two channels: satiation formation and habit formation. In this paper, we develop a theoretical foundation of satiation and habituation by an axiomatic approach.
Junyi Chai
doaj +1 more source
Axiomatic (and non-axiomatic) mathematics
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of Complete Ordered Fields with which Real Analysis starts.
openaire +3 more sources
Some Properties of Interval Shapley Values: An Axiomatic Analysis
Interval games are an extension of cooperative coalitional games, in which players are assumed to face payoff uncertainty. Characteristic functions thus assign a closed interval instead of a real number.
Shinichi Ishihara, Junnosuke Shino
doaj +1 more source
Axiomatization of betweenness in order-theoretic trees [PDF]
The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial orders such that the set of nodes larger than any node is linearly ...
Bruno Courcelle
doaj +1 more source
Maximizing the Minimal Satisfaction—Characterizations of Two Proportional Values
A class of solutions are introduced by lexicographically minimizing the complaint of coalitions for cooperative games with transferable utility. Among them, the nucleolus is an important representative.
Wenzhong Li, Genjiu Xu, Hao Sun
doaj +1 more source
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge [PDF]
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion ...
Luca Aceto +3 more
doaj +1 more source
Axiomatic characterization of PageRank
This paper examines the fundamental problem of identifying the most important nodes in a network. We use an axiomatic approach to this problem. Specifically, we propose six simple properties and prove that PageRank is the only centrality measure that satisfies all of them.
Tomasz Was, Oskar Skibski
openaire +3 more sources

