3,684 research outputs found
On Tarski's axiomatic foundations of the calculus of relations
It is shown that Tarski's set of ten axioms for the calculus of relations is
independent in the sense that no axiom can be derived from the remaining
axioms. It is also shown that by modifying one of Tarski's axioms slightly, and
in fact by replacing the right-hand distributive law for relative
multiplication with its left-hand version, we arrive at an equivalent set of
axioms which is redundant in the sense that one of the axioms, namely the
second involution law, is derivable from the other axioms. The set of remaining
axioms is independent. Finally, it is shown that if both the left-hand and
right-hand distributive laws for relative multiplication are included in the
set of axioms, then two of Tarski's other axioms become redundant, namely the
second involution law and the distributive law for converse. The set of
remaining axioms is independent and equivalent to Tarski's axiom system
A Sound and Complete Axiomatization of Majority-n Logic
Manipulating logic functions via majority operators recently drew the
attention of researchers in computer science. For example, circuit optimization
based on majority operators enables superior results as compared to traditional
logic systems. Also, the Boolean satisfiability problem finds new solving
approaches when described in terms of majority decisions. To support computer
logic applications based on majority a sound and complete set of axioms is
required. Most of the recent advances in majority logic deal only with ternary
majority (MAJ- 3) operators because the axiomatization with solely MAJ-3 and
complementation operators is well understood. However, it is of interest
extending such axiomatization to n-ary majority operators (MAJ-n) from both the
theoretical and practical perspective. In this work, we address this issue by
introducing a sound and complete axiomatization of MAJ-n logic. Our
axiomatization naturally includes existing majority logic systems. Based on
this general set of axioms, computer applications can now fully exploit the
expressive power of majority logic.Comment: Accepted by the IEEE Transactions on Computer
Quantum information as a non-Kolmogorovian generalization of Shannon's theory
In this article we discuss the formal structure of a generalized information
theory based on the extension of the probability calculus of Kolmogorov to a
(possibly) non-commutative setting. By studying this framework, we argue that
quantum information can be considered as a particular case of a huge family of
non-commutative extensions of its classical counterpart. In any conceivable
information theory, the possibility of dealing with different kinds of
information measures plays a key role. Here, we generalize a notion of state
spectrum, allowing us to introduce a majorization relation and a new family of
generalized entropic measures
Expanding FLew with a Boolean connective
We expand FLew with a unary connective whose algebraic counterpart is the
operation that gives the greatest complemented element below a given argument.
We prove that the expanded logic is conservative and has the Finite Model
Property. We also prove that the corresponding expansion of the class of
residuated lattices is an equational class.Comment: 15 pages, 4 figures in Soft Computing, published online 23 July 201
Generalized probabilities in statistical theories
In this review article we present different formal frameworks for the
description of generalized probabilities in statistical theories. We discuss
the particular cases of probabilities appearing in classical and quantum
mechanics, possible generalizations of the approaches of A. N. Kolmogorov and
R. T. Cox to non-commutative models, and the approach to generalized
probabilities based on convex sets
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
A Meta-Logic of Inference Rules: Syntax
This work was intended to be an attempt to introduce the meta-language for
working with multiple-conclusion inference rules that admit asserted
propositions along with the rejected propositions. The presence of rejected
propositions, and especially the presence of the rule of reverse substitution,
requires certain change the definition of structurality
- …