This paper deals with Boolean algebras supplied with an additional binary operation, calledB-algebras for short.The aim of the paper is to generalize some theorems concerning topological Boolean algebras to more comprehensive classes ofB-algebras, to formulate fundamental properties ofB-algebras, and to find more important relationships of these algebras to other known algebras.

Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary refinement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary refinement implies that the class of detachable subsets of a set form a set. Binary refinement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was sufficient to (...) prove that the Dedekind reals form a set. Here we show that the Cauchy reals also form a set. More generally, binary refinement ensures that one remains in the realm of sets when one starts from discrete sets and one applies the operations of exponentiation and binary product a finite number of times. (shrink)

Standard unary modal logic and binary modal logic, i.e. modal logic with one binary operator, are shown to be definitional extensions of one another when an additional axiom |$U$| is added to the basic axiomatization of the binary side. This is a strengthening of our previous results. It follows that all unary modal logics extending Classical Modal Logic, in other words all unary modal logics with a neighborhood semantics, can equivalently be seen as binary modal logics. (...) This in particular applies to standard modal logics, which can be given simple natural axiomatizations in binary form. We illustrate this in the logic K. We call such logics binary expansions of the unary modal logics. There are many more such binary expansions than the ones given by the axiom |$U$|⁠. We initiate an investigation of the properties of these expansions and in particular of the maximal binary expansions of a logic. Our results directly imply that all sub- and superintuitionistic logics with a standard modal companion also have binary modal companions. The latter also applies to the weak subintuitionistic logic WF of our previous papers. This logic doesn’t seem to have a unary modal companion. (shrink)

Philosophical and ethical discussions of warfare are often tied to emerging technologies and techniques. Today we are presented with what many believe is a radical shift in the nature of war-the realization of conflict in the cyber-realm, the so-called.

This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with (...) a term forming operator. In the final section rules for I for negative free and classical logic are also mentioned. (shrink)

The pigeon-inspired optimization algorithm is a category of a newly proposed swarm intelligence-based algorithm that belongs to the population-based solution technique. The MKP is a class of complex optimization problems that have many practical applications in the fields of engineering and sciences. Due to the practical applications of MKP, numerous algorithmic-based methods like local search and population-based search algorithms have been proposed to solve the MKP in the past few decades. This paper proposes a modified binary pigeon-inspired optimization algorithm (...) named (Modified-BPIO) for the 0 - 1 multidimensional knapsack problem (MKP). The utilization of the binary pigeon-inspired optimization (BPIO) for solving the multidimensional knapsack problem came with huge success. However, it can be observed that the BPIO converges prematurely due to lost diversity during the search activities. Given the above, the crossover operator is integrated with the landmark component of the BPIO to improve the diversity of the solution space. The MKP benchmarks from the Operations Research (OR) library are utilized to test the performance of the proposed binary method. Experimentally, it is concluded that the proposed Modified-BPIO has a better performance when compared with the BPIO and existing state-of-the-arts that worked on the same MKP benchmarks. (shrink)

It, is shown that Birkhoff –von Neumann quantum logic (i.e., an orthomodular lattice or poset) possessing an ordering set of probability measures S can be isomorphically represented as a family of fuzzy subsets of S or, equivalently, as a family of propositional functions with arguments ranging over S and belonging to the domain of infinite-valued Łukasiewicz logic. This representation endows BvN quantum logic with a new pair of partially defined binary operations, different from the order-theoretic ones: Łukasiewicz intersection and (...) union of fuzzy sets in the first case and Łukasiewicz conjunction and disjunction in the second. Relations between old and new operations are studied and it is shown that although they coincide whenever new operations are defined, they are not identical in general. The hypothesis that quantum-logical conjunction and disjunction should be represented by Łukasiewicz operations, not by order-theoretic join and meet is formulated and some of its possible consequences are considered. (shrink)

We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order logic.

In the moral realm, our deontic judgments are usually (always?) binary. An act (or omission) is either morally forbidden or morally permissible. 1 Yet the determination of an act's deontic status frequently turns on the existence of properties that are matters of degree. In what follows I shall give several examples of binary moral judgments that turn on scalar properties, and I shall claim that these examples should puzzle us. How can the existence of a property to a (...) specific degree demarcate a boundary between an act's being morally forbidden and its not being morally forbidden? Why aren't our moral judgments of acts scalar in the way that the properties on which those judgments are based are scalar, so that acts, like states of affairs, can be morally better or worse rather than right or wrong? I conceive of this inquiry as operating primarily within the realm of normative theory. Presumably it will give aid and comfort to consequentialists, who have no trouble mapping their binary categories onto scalar properties. For example, a straightforward act utilitarian, for whom one act out of all possible acts is morally required (and hence permissible) and all others morally forbidden, can, in theory at least, provide an answer to every one of the puzzles I raise. And, in theory, so can all other types of act and rule consequentialists. They will find nothing of interest here beyond embarrassment for their deontological adversaries. The deontologists, however, must meet the challenges of these puzzles. And for them, the puzzles may raise not just normative questions, but questions of moral epistemology and moral ontology. Just how do we know that the act consequentialist's way of, say, trading off lives against lives is wrong? For example, do we merely intuit that taking one innocent, uninvolved person's life to save two others is wrong? Can our method of reflective equilibrium work if we have no theory by which to rationalize our intuitions? And what things in the world make it true, if it is true, that one may not make the act consequentialist's tradeoff? I do not provide any answers to these questions any more than I provide answers to the normative ones. But they surely lurk in the background. (shrink)

The binary between the figure of the child and the fully human being is invoked with regularity in analyses of race, yet its centrality to the conception of race has never been fully explored. For most commentators, the figure of the child operates as a metaphoric or rhetorical trope, a non-essential strategic tool in the perpetuation of White supremacy. As I show in the following, the child/human binary does not present a contingent or merely rhetorical construction but, rather, (...) a central feature of racialization. Where Black peoples are situated as objects of violence it is often precisely because Blackness has been identified with childhood and childhood is historically identified as the archetypal site of naturalized violence and servitude. I proceed by offering a historical account of how Black peoples came to inherit the subordination and dehumanization of European childhood and how White youth were subsequently spared through their partial categorization as adults. (shrink)

This paper addresses how multiple individual credences on logically related issues should be aggregated into collective binary beliefs. We call this binarizing belief aggregation. It is vulnerable to dilemmas such as the discursive dilemma or the lottery paradox: proposition-wise independent aggregation can generate inconsistent or not deductively closed collective judgments. Addressing this challenge using the familiar axiomatic approach, we introduce general conditions on a binarizing belief aggregation rule, including rationality conditions on individual inputs and collective outputs, and determine which (...) rules (if any) satisfy different combinations of these conditions. Furthermore, we analyze similarities and differences between our proofs and other related proofs in the literature and conclude that the problem of binarizing belief aggregation is a free-standing aggregation problem not reducible to judgment aggregation or probabilistic opinion pooling. (shrink)

It is a classic result in modal logic, often referred to as Jónsson-Tarski duality, that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous. This duality generalizes the celebrated Stone duality for boolean algebras. Our goal is to generalize descriptive frames so that the topology is an arbitrary compact Hausdorff topology. For this, instead of working with the (...) boolean algebra of clopen subsets of a Stone space, we work with the ring of continuous real-valued functions on a compact Hausdorff space. The main novelty is to define a modal operator on such a ring utilizing a continuous relation on a compact Hausdorff space.Our starting point is the well-known Gelfand duality between the category ${\sf KHaus}$ of compact Hausdorff spaces and the category $\boldsymbol {\mathit {uba}\ell }$ of uniformly complete bounded archimedean $\ell $ -algebras. We endow a bounded archimedean $\ell $ -algebra with a modal operator, which results in the category $\boldsymbol {\mathit {mba}\ell }$ of modal bounded archimedean $\ell $ -algebras. Our main result establishes a dual adjunction between $\boldsymbol {\mathit {mba}\ell }$ and the category ${\sf KHF}$ of what we call compact Hausdorff frames; that is, Kripke frames equipped with a compact Hausdorff topology such that the binary relation is continuous. This dual adjunction restricts to a dual equivalence between ${\sf KHF}$ and the reflective subcategory $\boldsymbol {\mathit {muba}\ell }$ of $\boldsymbol {\mathit {mba}\ell }$ consisting of uniformly complete objects of $\boldsymbol {\mathit {mba}\ell }$. This generalizes both Gelfand duality and Jónsson-Tarski duality. (shrink)

B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.

Let S be a signature of operations and relations definable in relation algebra, let R be the class of all S-structures isomorphic to concrete algebras of binary relations with concrete interpretations for symbols in S, and let F be the class of S-structures isomorphic to concrete algebras of binary relations over a finite base. To prove that membership of R or F for finite S-structures is undecidable, we reduce from a known undecidable problem—here we use the tiling problem, (...) the partial group embedding problem and the partial group finite embedding problem to prove undecidability of finite membership of R or F for various signatures S. It follows that the equational theory of R is undecidable whenever S includes the boolean operators and composition. We give an exposition of the reduction from the tiling problem and the reduction from the group embedding problem, and summarize what we know about the undecidability of finite membership of R and of F for different signatures S. (shrink)

In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [10]. A frontal operator in a weak Heyting algebra A is an expansive operator r preserving finite meets which also satisfies the equation?? b V, for all a,b? A. These operators were studied from an algebraic, logical and topological point of view by Leo Esakia in [10]. We will study frontal operators (...) in weak Heyting algebras and we will consider two examples of them. We will give a Priestley duality for the category of frontal weak Heyting algebras in terms of relational spaces where is a WH space [6], and R is an additional binary relation used to interpret the modal operator. We will also study the WH- algebras with successor and the WTf- algebras with gamma. For these varieties we will give two topological dualities. The first one is based on the representation given for the frontal weak Heyting algebras. The second one is based on certain particular classes of WH-spaces. (shrink)

We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we pinpoint the theorems (...) of Fol that are needed in the proof. Using the insights gained from the proof, we show that there are four binary operators that each can serve as the only undefined logical constant for Fol . Finally, we show that from every n -ary connective that yields a functionally complete singleton set of connectives two Schönfinkel-type operators are definable, and all the latter are so definable. (shrink)

We proved in the first part [1] that plane geometry over Pythagorean fields is axiomatizable by quantifier-free axioms in a language with three individual constants, one binary and three ternary operation symbols. In this paper we prove that two of these operation symbols are superfluous.

We study a theory PTO of polynomial time computability on the type of binary strings, as embedded in full lambda calculus with total application and extensionality. We prove that the closed terms of type W → W are exactly the polynomial time operations. This answers a conjecture of Strahm [13].

In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [ 10 ]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation $${\tau(a) \leq b \vee (b \rightarrow a)}$$, for all $${a, b \in A}$$. These operators were studied from an algebraic, logical and topological point of view by Leo (...) Esakia in [ 10 ]. We will study frontal operators in weak Heyting algebras and we will consider two examples of them. We will give a Priestley duality for the category of frontal weak Heyting algebras in terms of relational spaces $${\langle X, \leq, T, R \rangle}$$ where $${\langle X, \leq, T \rangle}$$ is a WH -space [ 6 ], and R is an additional binary relation used to interpret the modal operator. We will also study the WH -algebras with successor and the WH -algebras with gamma. For these varieties we will give two topological dualities. The first one is based on the representation given for the frontal weak Heyting algebras. The second one is based on certain particular classes of WH -spaces. (shrink)

ABSTRACT This article explores how our thinking about time shapes epistemological and ontological understandings of the world. It considers the idea of modernity as constituted by the ancient/modern binary through an examination of Montesquieu’s and Benjamin Constant’s development of this binary in relation to their understandings of commerce, the law of nations and conquest, political rule and freedom in the context of European colonial empire. Modernity demarcates a break in (historical) time between a past and a present that (...) extends into a future. This rupture plays a role in distinctions between modern European and pre-modern non-European societies. The ancient/modern binary underpins conceptions of collective and individual liberty. It associates modernity with individual liberty, progress, reason and science. I analyse how this binary operated across space to categorise various societies as not modern, pre-modern or less developed according to levels of scientific, technological, political and economic progress in Montesquieu’s thought and through Constant’s silences. This article develops an innovative reading of the ancient/modern binary in French political thought. (shrink)

Given current data, only a few binary Boolean operators are expressed in lexically simple fashion in the world's languages: and, or, nor. These do not occur in every combination, for example, nor is not observed by itself. To explain these cross‐linguistic patterns, we propose an encoding of Boolean operators as update procedures to accept or reject information in a context. We define a measure of conceptual simplicity for such updates, on which attested operators are conceptually simpler (...) than the remaining Booleans. Moreover, we show that language evolution selects for the attested lexical inventories by minimizing the complexity of using a lexical inventory compositionally to convey precise information. (shrink)

One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to find the (...) optimal solution for the original and dual models at the same time. The importance of this algorithm is evident in that it is relied upon in several operations research topics, such as integer programming algorithms, some nonlinear programming algorithms, and sensitivity analysis in linear programming. (shrink)

In this paper we study (self)-applicative theories of operations and binary words in the context of polynomial time computability. We propose a first order theory PTO which allows full self-application and whose provably total functions on W = {0, 1} * are exactly the polynomial time computable functions. Our treatment of PTO is proof-theoretic and very much in the spirit of reductive proof theory.

The Suslin operator is a type-2 functional testing for the well-foundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoretic strength has been analyzed in Jäger and Strahm [18]. This article provides a more direct approach to the computation of the upper bounds in question. Several theories featuring the Suslin operator are embedded into ordinal theories tailored for dealing with non-monotone inductive definitions that enable a smooth definition of the application relation.

-/- This unique book develops an operational approach to preference and rationality as the author employs operators over binary relations to capture the concept of rationality. -/- A preference is a basis of individual behavior and social judgment and is mathematically regarded as a binary relation on the set of alternatives. Traditionally, an individual/social preference is assumed to satisfy completeness and transitivity. However, each of the two conditions is often considered to be too demanding; and then, weaker (...) rationality conditions are introduced by researchers. This book argues that the preference rationality conditions can be captured mathematically by “operators,” which are mappings from the set of operators to itself. This operational approach nests traditional concepts in individual/social decision theory and clarifies the underlying formal structure of preference rationality. -/- The author also applies his approach to welfare economics. The core problem of ‘new welfare economics,’ developed by Kaldor, Hicks, and Samuelson, is the rationality of social preference. In this book the author translates the social criteria proposed by those three economists into operational forms, which provide new insights into welfare economics extending beyond ‘new welfare economics.’ . (shrink)

The science of operations research is one of the modern sciences that have made a great revolution in all areas of life through the methods provided by it, suitable and appropriate to solve most of the problems that were facing researchers, scholars and those interested in the development of societies, and the most beneficiaries of this science were companies and institutions that are looking for scientific methods that help them manage their work so that they achieve the greatest profit and (...) the lowest cost, and one of the important methods that have been used in the management of companies we offer in this research two methods, Dynamic programming method. This method has been used in many practical matters and helped decision-makers in companies to achieve a maximum profit and less cost by formulating the reality of the state of the company and the data provided by decision-makers with a dynamic mathematical model that is solved using methods of solving dynamic models and we will provide in this research an example of this through the issue of choosing the optimal investment for the budget of a company so that it achieves a maximum profit, and the method of programming with integers: the method that provided these companies with solutions with integer values suitable for the nature of its work, through the use of the binary integer in the formulation of the appropriate mathematical model on the one hand, and on the other hand, the use of the binary integer variable helped to convert some nonlinear models that lead to some practical problems into linear models, and it should be noted here that in the previous two methods there is something indeterminable because we must make a decision in choosing or not choosing something, but the optimal solution that we will get remains A specific value because we are building the mathematical model for any realistic issue through the data provided by those responsible for the work and these data are calculated quantities and therefore they are uncertain values because their validity depends on the circumstances surrounding the work environment, they may be exposed to increase or decrease, and therefore the optimal solution on which the company will base its decision is suitable for specific values and any change in them can cause the company an uncalculated loss, so in this research we will use the concepts of neutrosophic science, the branch of science founded by the American scientist Florentin Smarandache in 1995 based on his belief that there is no absolute truth, a science that is interested in the study of ideas and concepts that are neither true nor false, but just in between, and we will take the data (calculated quantities) neutrosophic values that are specified or unspecified values are any set close to the calculated quantities, then the resulting mathematical model is a neutrosophic model and the optimal solution has neutrosophic values and thanks to the indefinite uncertainty that these values have, companies from the development of appropriate plans for all circumstances and thus achieve the greatest profit and the lowest cost, and we will clarify the above through two issues, the issue of optimal designation of a warehouse site, which we will formulate the mathematical model of using the neutrosophic integer programming method - and the issue of capital budget, which we will present in two different forms, we use in the first form the neutrosophic integer programming method and in the second the neutrosophic dynamic programming method. (shrink)

We prove that the equational theory of a semigroups becomes undecidable if we add a semilattice structure with a ‘touch of symmetric difference’. As a corollary we obtain that the variety of all Boolean algebras with an associative binary operator has a ‘hereditarily’ undecidable equational theory. Our results have implications in logic, e.g. they imply undecidability of modal logics extending the Lambek Calculus and undecidability of Arrow Logics with an associative arrow modality.

We give an overview of decidability results for modal logics having a binary modality. We put an emphasis on the demonstration of proof-techniques, and hope that this will also help in finding the borderlines between decidable and undecidable fragments of usual first-order logic.

In Spescha and Strahm [15], a system of explicit mathematics in the style of Feferman [6] and [7] is introduced, and in Spescha and Strahm [16] the addition of the join principle to is studied. Changing to intuitionistic logic, it could be shown that the provably terminating operations of are the polytime functions on binary words. However, although strongly conjectured, it remained open whether the same holds true for the corresponding theory with classical logic. This note supplements a proof (...) of this conjecture. (shrink)

The study considers the development of methods for detecting anomalous network connections based on hybridization of computational intelligence methods. An analysis of approaches to detecting anomalies and abuses in computer networks. In the framework of this analysis, a classification of methods for detecting network attacks is proposed. The main results are reduced to the construction of multi-class models that increase the efficiency of the attack detection system, and can be used to build systems for classifying network parameters during the attack. (...) A model of an artificial immune system based on an evolutionary approach, an algorithm for genetic-competitive learning of the Kohonen network and a method of hierarchical hybridization of binary classifiers with the addition to the detection of anomalous network connections have been developed. The architecture of the network distributed attack detection system has been developed. The architecture of the attack detection system is two-tier: the first level provides the primary analysis of individual packets and network connections using signature analysis, the second level processes the processing of aggregate network data streams using adaptive classifiers. A signature analysis was performed to study network performance based on the Aho-Korasik and Boyer-Moore algorithms and their improved analogues were implemented using OpenMP and CUDA technologies. The architecture is presented and the main points of operation of the network attack generator are shown. A system for generating network attacks has been developed. This system consists of two components: an asynchronous transparent proxy server for TCP sessions and a frontend interface for a network attack generator. The results of the experiments confirmed that the functional and non-functional requirements, as well as the requirements for computing intelligent systems, are met for the developed attack detection system. (shrink)

Modal logics with the binary operator Until are considered. It is shown that there exists a continuum of consistent U-logics without Kripke frames, and that each U-logic whose class of order does not have the finite frame property.

We consider a confidence parametrization of binary information sources in terms of appropriate likelihood ratios. This parametrization is used for Bayesian belief updates and for the equivalent comparison of binary experiments. In contrast to the standard parametrization of a binary information source in terms of its specificity and its sensitivity, one of the two confidence parameters is sufficient for a Bayesian belief update conditional on a signal realization. We introduce a confidence-augmented receiver operating characteristic for comparisons of (...) binary experiments for a class of “balanced” decision problems, relative to which the confidence order offers a higher resolution than Blackwell’s informativeness order. Where observation is concerned, Chance favors only the prepared mind.—Louis Pasteur (1822–1895). (shrink)

Advanced Virgo detector joined advanced LIGO twin detectors on 1st August 2017 in the quest to look for the gravitational waves. The global network of three detectors was operational for 25 days until the LIGO shut down on 25th August 2017. Two gravitational wave events were registered during this period. One of them was the binary black hole merger dubbed as GW170814 and other one is binary neutron star merger referred to as GW170817. Electromagnetic counterpart associated with (...) class='Hi'>binary neutron star merger was promptly identified which marks the beginning of multi-messenger astronomy. This article describes these events emphasizing on the crucial role played by the Virgo and focusing on some methodological issues. (shrink)

In this paper we study -applicative theories of operations and binary words in the context of polynomial time computability. We propose a first order theory PTO which allows full self-application and whose provably total functions on $\mathbb{W} = \{0, 1\}^\ast$ are exactly the polynomial time computable functions. Our treatment of PTO is proof-theoretic and very much in the spirit of reductive proof theory.

We prove an exponential lower bound on the size of proofs in the proof system operating with ordered binary decision diagrams introduced by Atserias, Kolaitis and Vardi [2]. In fact, the lower bound applies to semantic derivations operating with sets defined by OBDDs. We do not assume any particular format of proofs or ordering of variables, the hard formulas are in CNF. We utilize (somewhat indirectly) feasible interpolation. We define a proof system combining resolution and the OBDD proof system.

I consider how complex logical operations might self-assemble in a signalling-game context via composition of simpler underlying dispositions. On the one hand, agents may take advantage of pre-evolved dispositions; on the other hand, they may co-evolve dispositions as they simultaneously learn to combine them to display more complex behaviour. In either case, the evolution of complex logical operations can be more efficient than evolving such capacities from scratch. Showing how complex phenomena like these might evolve provides an additional path to (...) the possibility of evolving more or less rich notions of compositionality. This helps provide another facet of the evolutionary story of how sufficiently rich, human-level cognitive or linguistic capacities may arise from simpler precursors. 1Signalling and Self-assembly2Simple Unary Logic Games3Composing Unary Functions for Binary Inputs 3.1Utilizing pre-evolved dispositions3.2Co-evolving logical dispositions3.3Learning appropriate outputs3.4Taking account of the full state-space of unary games3.5Role-free composition4Discussion 4.1Efficacy and efficiency of learning complex dispositions4.2Other binary operations4.3To infinity and beyond5Conclusion. (shrink)

This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the first-order applicative theories introduced in Strahm [19, 20].

While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort (...) to gain a better understanding of the empirical efficiency of the algorithms involved, a fault diagnosis problem on combinational circuits is presented, implemented and evaluated. (shrink)

We show the undecidability of the equational theories of some classes of BAOs with a non-associative, residuated binary extra-Boolean operator. These results solve problems in Jipsen [9], Pratt [21] and Roorda [22], [23]. This paper complements Andréka-Kurucz-Németi-Sain-Simon [3] where the emphasis is on BAOs with an associative binary operator.