Results 1 to 10 of about 506 (185)
Axiomatization of Blockchain Theory
Mathematics, 2023 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.
Andrey Nechesov, Goncharov Sergey
exaly +3 more sources
Information and Computation, 2005 In this paper a sound and complete axiomatization for \(\text{PCTL}^*\) (computation tree logic with past operators) is given. This axiomatization is for the logic presented by \textit{F. Laroussinie} and \textit{Ph. Schnoebelen} [``Specification in \(\text{CTL}\) + past for verification in \(\text{CTL}\)'', Inf. Comput.
Mark Reynolds
exaly +3 more sources
Shapley Mapping and Its Axiomatizations in n-Person Cooperative Interval Games
Mathematics, 2022 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.
Junnosuke Shino +2 more
doaj +1 more source
The Cardinal Squaring Principle and an Alternative Axiomatization of NFU
Bulletin of the Section of Logic, 2023 In this paper, we rigorously prove the existence of type-level ordered pairs in Quine’s New Foundations with atoms, augmented by the axiom of infinity and the axiom of choice (NFU + Inf + AC).
Tin Adlešić, Vedran Čačić
doaj +1 more source
The Single Axiomatization on CCRL-Fuzzy Rough Approximation Operators and Related Fuzzy Topology
Axioms, 2022 It is well known that lattice-valued rough sets are important branches of fuzzy rough sets. The axiomatic characterization and related topology are the main research directions of lattice-valued rough sets.
Yaoliang Xu, Dandan Zou, Lingqiang Li
doaj +1 more source
On the Axiomatizability of Impossible Futures [PDF]
Logical Methods in Computer Science, 2015 A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS.
Taolue Chen +2 more
doaj +1 more source
Social Choice and Welfare, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clemens Puppe, Attila Tasnádi
openaire +7 more sources
Quantifying over Boolean announcements [PDF]
Logical Methods in Computer Science, 2022 Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL.
Hans van Ditmarsch, Tim French
doaj +1 more source
Characteristic Sequence of Strongly Minimal Directed Single Graphs of 1-Arity
Computation, 2022 In this paper, we will classify the strongly minimal directed single graphs of 1-arity by axiomatizing the theory of characteristic sequence of such a graph. Then we will show this theory is complete by using Łos-Vaught test. Complete theory is important
Abeer M. Albalahi
doaj +1 more source
Impure Simplicial Complexes: Complete Axiomatization [PDF]
Logical Methods in Computer Science, 2023 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