Results 21 to 30 of about 454 (145)
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
AbstractFollowing the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language.
Sato, Kentaro, Walker, Jan
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Puppe, Clemens, Tasnádi, Attila
openaire +7 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 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
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
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
Infinitary Axiomatization of the Equational Theory of Context-Free Languages [PDF]
We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Leiß (1992).
Niels Bjørn Bugge Grathwohl +2 more
doaj +1 more source

