Results 11 to 20 of about 503 (185)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clemens Puppe, Attila Tasnádi
openaire +7 more sources
Impure Simplicial Complexes: Complete Axiomatization [PDF]
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment.
Rojo Randrianomentsoa +2 more
doaj +1 more source
Potential Surprise Theory as a Practical and Theoretical Cornerstone of the Uncertainty-Based Perspective on Risk. [PDF]
ABSTRACT From all the knowledge that would emerge as relevant to it over infinite time, a risk analysis must be based on the cross‐section available at its undertaking. This creates a knowledge gap, which can lead to surprises. To address a similar problem in economic decision‐making, G. L. S. Shackle developed potential surprise theory (PST).
Derbyshire J.
europepmc +2 more sources
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
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
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
Axiomatization of Blockchain Theory
The increasing use of artificial intelligence algorithms, smart contracts, the internet of things, cryptocurrencies, and digital money highlights the need for secure and sustainable decentralized solutions.
Sergey Goncharov, Andrey Nechesov
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

