We explore a possibility of generalization of classical truth values by distinguishing between their ontological and epistemic aspects and combining these aspects within a joint semantical framework. The outcome is four generalized classical truth values implemented by Cartesian product of two sets of classical truth values, where each generalized value comprises both ontological and epistemic components. This allows one to define two unary twin connectives that can be called “semi-classical negations”. Each of these negations deals only with one of (...) the above mentioned components, and they may be of use for a logical reconstruction of argumentative reasoning. (shrink)

We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A Cohen algebra is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of Cohen algebras: semi-Cohen algebras, pseudo-Cohen algebras and potentially Cohen algebras. These classes of Boolean algebras are closed under completion.

Semi-Post algebras of any type T being a poset have been introduced and investigated in [CR87a], [CR87b]. Plain Semi-Post algebras are in this paper singled out among semi-Post algebras because of their simplicity, greatest similarity with Post algebras as well as their importance in logics for approximation reasoning ([Ra87a], [Ra87b], [RaEp87]). They are pseudo-Boolean algebras generated in a sense by corresponding Boolean algebras and a poset T. Every element has a unique descending representation by means (...) of elements in a corresponding Boolean algebra and primitive Post constants which form a poset T. An axiomatization and another characterization, subalgebras, homomorphisms, congruences determined by special filters and a representability theory of these algebras, connected with that for Boolean algebras, are the subject of this paper. (shrink)

This article contains the proof of equivalence boolean algebra and syllogistics arc2. The system arc2 is obtained as a superstructure above the propositional calculus. Subjects and predicates of syllogistic functors a, E, J, O may be complex terms, Which are formed using operations of intersection, Union and complement. In contrast to negative sentences the interpretation of affirmative sentences suggests non-Empty terms. To prove the corresponding theorem we demonstrate that boolean algebra is included into syllogistics arc2 and vice versa.

In an accompanying paper Gomes, we have put forward an interpretation of quantum mechanics based on a non-relativistic, Lagrangian 3+1 formalism of a closed Universe M, existing on timeless configuration space \ of some field over M. However, not much was said there about the role of locality, which was not assumed. This paper is an attempt to fill that gap. Locality in full can only emerge dynamically, and is not postulated. This new understanding of locality is based solely on (...) the properties of extremal paths in configuration space. I do not demand locality from the start, as it is usually done, but showed conditions under which certain systems exhibit it spontaneously. In this way we recover semi-classical local behavior when regions dynamically decouple from each other, a notion more appropriate for extension into quantum mechanics. The dynamics of a sub-region O within the closed manifold M is independent of its complement, \, if the projection of extremal curves on \ onto the space of extremal curves intrinsic to O is a surjective map. This roughly corresponds to \, where \ is a linear projection. This criterion for locality can be made approximate—an impossible feat had it been already postulated—and it can be applied for theories which do not have hyperbolic equations of motion, and/or no fixed causal structure. When two regions are mutually independent according to the criterion proposed here, the semi-classical path integral kernel factorizes, showing cluster decomposition which is the ultimate aim of a definition of locality. (shrink)

Famous for the number-theoretic first-order statement known as Goodstein's theorem, author R. L. Goodstein was also well known as a distinguished educator. With this text, he offers an elementary treatment that employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. The text begins with an informal introduction to the algebra of classes, exploring union, intersection, and complementation; the commutative, associative, and distributive laws; difference and symmetric difference; and Venn diagrams. Professor Goodstein proceeds to (...) a detailed examination of three different axiomatizations, and an outline of a fourth system of axioms appears in the examples. The final chapter, on lattices, examines Boolean algebra in the setting of the theory of partial order. Numerous examples appear at the end of each chapter, with full solutions at the end. (shrink)

The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to know­ledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and (...) logic gates, computer programming languages, probability theory, and database queries. An analysis is offered of shortcomings that Boolean logic has in terms of potential uses in know­ledge organization. (shrink)

We study instantiated abstract argumentation frames of the form, where is an abstract argumentation frame and where the arguments x of S are instantiated by I as well formed formulas of a well known logic, for example as Boolean formulas or as predicate logic formulas or as modal logic formulas. We use the method of conceptual analysis to derive the properties of our proposed system. We seek to define the notion of complete extensions for such systems and provide algorithms (...) for finding such extensions. We further develop a theory of instantiation in the abstract, using the framework of Boolean attack formations and of conjunctive and disjunctive attacks. We discuss applications and compare critically with the existing related literature. (shrink)

It is shown that the Boolean center of complemented elements in a bounded integral residuated lattice characterizes direct decompositions. Generalizing both Boolean products and poset sums of residuated lattices, the concepts of poset product, Priestley product and Esakia product of algebras are defined and used to prove decomposition theorems for various ordered algebras. In particular, we show that FLw-algebras decompose as a poset product over any finite set of join irreducible strongly central elements, and that bounded n-potent GBL-algebras (...) are represented as Esakia products of simple n-potent MV-algebras. (shrink)

The problem of enumerating the types of Boolean functions under the group of variable permutations and complementations was first stated by Jevons in the 1870s. but not solved in a satisfactory way until the work of Pólya in 1940. This paper explains the details of Pólya's solution, and also the history of the problem from the 1870s to the 1970s.

We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in semi-reduced form satisfying certain specific additional requirements. Using developed technique we also find a basis for rules admissible in the logic of excluded middle law KC.

In this paper the descriptions of the relation semi-algebra generated by an equivalence element and the relation algebra generated by an equivalence element are unified by functorial constructions. Here the developed techniques and ideas lead to a more manageable conceptual construction of universal objects for the functors of squares and special congruences.

This is an introduction to the most primitive form of the new Boolean relation theory, where we work with only one function and one set. We give eight complete classifications. The thin set theorem (along with a slight variant), and the complementation theorem are the only substantial cases that arise in these classifications.

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and (...) a natural extension of BLT is definitionally equivalent with ZF. (shrink)

Emergence of the novel pathogenic coronavirus SARS‐CoV‐2 and its rapid pandemic spread presents challenges that demand immediate attention. Here, we describe the development of a semi‐quantitative high‐content microscopy‐based assay for detection of three major classes (IgG, IgA, and IgM) of SARS‐CoV‐2 specific antibodies in human samples. The possibility to detect antibodies against the entire viral proteome together with a robust semi‐automated image analysis workflow resulted in specific, sensitive and unbiased assay that complements the portfolio of SARS‐CoV‐2 serological assays. (...) Sensitive, specific and quantitative serological assays are urgently needed for a better understanding of humoral immune response against the virus as a basis for developing public health strategies to control viral spread. The procedure described here has been used for clinical studies and provides a general framework for the application of quantitative high‐throughput microscopy to rapidly develop serological assays for emerging virus infections. (shrink)

A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets, and that negation with the Kleene property is describable by the set-theoretic complement. The propositional logic \ of Kleene algebras is shown to be sound and complete with respect to a 3-valued and a rough set semantics. It is also established that Kleene negation can be considered as a modal operator, due to a perp (...) semantics of \. Moreover, another representation of Kleene algebras is obtained in the class of complex algebras of compatibility frames. One concludes with the observation that \ can be imparted semantics from different perspectives. (shrink)

An explicit categorical equivalence is defined between a proper subvariety of the class of \-algebras, as defined by Di Nola and Dvurečenskij, to be called \-algebras, and the category of semi-low \-rings. This categorical representation is done using the prime spectrum of the \-algebras, through the equivalence between \-algebras and \-groups established by Mundici, from the perspective of the Dubuc–Poveda approach, that extends the construction defined by Chang on chains. As a particular case, semi-low \-rings associated to (...) class='Hi'>Boolean algebras are characterized. (shrink)

An explicit categorical equivalence is defined between a proper subvariety of the class of \-algebras, as defined by Di Nola and Dvurečenskij, to be called \-algebras, and the category of semi-low \-rings. This categorical representation is done using the prime spectrum of the \-algebras, through the equivalence between \-algebras and \-groups established by Mundici, from the perspective of the Dubuc–Poveda approach, that extends the construction defined by Chang on chains. As a particular case, semi-low \-rings associated to (...) class='Hi'>Boolean algebras are characterized. (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.

Given an admissible indexing φ of the countable atomless Boolean algebra B, an automorphism F of B is said to be recursively presented (relative to φ) if there exists a recursive function $p \in \operatorname{Sym}(\omega)$ such that F ⚬ φ = φ ⚬ p. Our key result on recursiveness: Both the subset of $\operatorname{Aut}(\mathscr{B})$ consisting of all those automorphisms which are recursively presented relative to some indexing, and its complement, the set of all "totally nonrecursive" automorphisms, are uncountable. This (...) arises as a consequence of the following combinatorial investigations: (1) A comparison of the cycle structures of f and f̄, where f is a permutation of some free basis of B and f̄ is the automorphism of B induced by f. (2) An explicit description of the permutations of ω whose conjugacy classes in $\operatorname{Sym}(\omega)$ are (a) uncountable, (b) countably infinite, and (c) finite. (shrink)

This paper intends to reveal the essential value of interactive media by fully understanding the complex interactive mechanism of human experience. Following Cartesian dualistic thought, interactive technology has primarily been utilized as a physical control device. It hasn’t sufficiently explored its gigantic potential as a true interactive medium. Interactive technology reflects our desire to interact with someone or something. Historically, human desire for interaction has been continuously manifested from the day of primitive ritual to contemporary cyberspace. Our interactive routines have (...) continued, from micro to macro scale, in order to confirm our existence in every day life. This universal repetitive pattern of human activity is ‘the ritual’. It is ritual because it is the archetypes of cycles driven by human instinct, regardless of their cultural and historical period. In this paper, I am defining ‘the form of ritual’, to explain the fundamental human process of interaction and becoming, and furthermore, to find the imperative potential of interactive media. The form of ritual will be explained in detail, with agent, driving force, process and by-product, taking reference from Korean shaman ritual, Yin/Yang process and Alfred North Whitehead’s process philosophy. My virtual puppetry with spiralling interaction, ‘Yong-Shin-Gud’ (calling-dragon-spirit), will be introduced as an art example to carry out the ritual. Interactive technology is an ongoing expression of human desire. Its essential value would be found in understanding human beings, nature and cosmos. Revealing its hidden essence, historical presence and spiritual value will be the next paradigm of interactive art practice. (shrink)

We live in layers of mixed realities with continuous conflicts, negotiation and becoming. I find it interesting to look at our situation as a continuous struggle in the fusion of virtual/actual presences, and machine/human. However, we seem to be far from understanding these relationships. Maybe the problem lies in the questions themselves, promoting unidirectional preconceptions. By reversing the questions, we might be able to identify something that has been missing in previous discussions: Can we talk about disconnection to further discuss (...) connection? Can we talk about distancing to further discuss the process of becoming? Can we talk about love impossible, to further discuss love? This paradoxical journey would maintain us in the continuum of struggle and massive doubts, and encounter deep aspects of human being. In this article, I examine the Korean cultural psyche called han in the context of a paradoxical state of consciousness and the story of love impossible, and argue that han is a driving force of transformative ritual in human consciousness. Beyond cultural boundaries, this article also positions han in a microscopic view of contemporary life. han underlies paradoxical human relationships with objects, and with my virtual puppets, in the context of distance, disconnection and love impossible. (shrink)

A beautiful and thoughtful collection of essays on reading, writing and learning, _Writing and Psychoanalysis_ grows out of a colloquium. The results are wondrous and impact on the reader at many different levels. In the act of writing, we all discover something about what we know previously unknown to us, and we learn more about our inner world that we knew before we set pen to paper. Patrick Mahony goes so far as to argue that Freud's self-analysis was essentially a (...) "writing cure." _Writing in Psychoanalysis_ is the first volume in the projected Monograph Series, Psychoanalytic Issues, the _Rivista di Psicoanalisi_ is undertaking in conjunction with Karnac Books. This series constitutes a major effort to bring about a dialogue among psychoanalysts who while ultimately bound together by a common psychoanalytic heritage nonetheless are separated in their thinking by different idioms, whether linguistic or theoretical. While featuring writers of very different idioms, this series will also present a venue to make some important Italian voices known to English speaking analysts. (shrink)

Contact algebra is one of the main tools in region-based theory of space. In it is generalized by dropping the operation Boolean complement. Furthermore we can generalize contact algebra by dropping also the operation meet. Thus we obtain structures, called contact join-semilattices and structures, called distributive contact join-semilattices. We obtain a set-theoretical representation theorem for CJS and a relational representation theorem for DCJS. As corollaries we get also topological representation theorems. We prove that the universal theory of CJS and (...) of DCJS is the same and is decidable. (shrink)

The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to be a cover relation that includes that of the formal topology. The family of sublocales has set-indexed joins. For each set of base elements there are corresponding open and closed sublocales, boolean complements of each other. They generate a boolean algebra amongst the sublocales. In the case of an inductively generated formal (...) topology, the collection of inductively generated sublocales has coframe structure. Overt sublocales and weakly closed sublocales are described, and related via a new notion of "rest closed" sublocale to the binary positivity predicate. Overt, weakly closed sublocales of an inductively generated formal topology are in bijection with "lower powerpoints", arising from the impredicative theory of the lower powerlocale. Compact sublocales and fitted sublocales are described. Compact fitted sublocales of an inductively generated formal topology are in bijection with "upper powerpoints", arising from the impredicative theory of the upper powerlocale. (shrink)

Motivated by an old construction due to J. Kalman that relates distributive lattices and centered Kleene algebras we define the functor K • relating integral residuated lattices with 0 with certain involutive residuated lattices. Our work is also based on the results obtained by Cignoli about an adjunction between Heyting and Nelson algebras, which is an enrichment of the basic adjunction between lattices and Kleene algebras. The lifting of the functor to the category of residuated lattices leads us to study (...) other adjunctions and equivalences. For example, we treat the functor C whose domain is cuRL, the category of involutive residuated lattices M whose unit is fixed by the involution and has a Boolean complement c. If we restrict to the full subcategory NRL of cuRL of those objects that have a nilpotent c, then C is an equivalence. In fact, C M is isomorphic to C e M, and C e is adjoint to, where assigns to an object A of IRL0 the product A × A 0 which is an object of NRL. (shrink)

Tarski algebras, also known as implication algebras or semi-boolean algebras, are the \-subreducts of Boolean algebras. In this paper we shall introduce and study the complete and atomic Tarski algebras. We shall prove a duality between the complete and atomic Tarski algebras and the class of covering Tarski sets, i.e., structures \, where X is a non-empty set and \ is non-empty family of subsets of X such that \. This duality is a generalization of the known (...) duality between sets and complete and atomic Boolean algebras. We shall also analize the case of complete and atomic Tarski algebras endowed with a complete modal operator, and we will prove a duality for these algebras. (shrink)

The notion of contact algebra is one of the main tools in the region-based theory of space. It is an extension of Boolean algebra with an additional relation C called contact. There are some problems related to the motivation of the operation of Boolean complementation. Because of this operation is dropped and the language of distributive lattices is extended by considering as non-definable primitives the relations of contact, nontangential inclusion and dual contact. It is obtained an axiomatization (...) of the theory consisting of the universal formulas in the language true in all contact algebras. The structures in, satisfying the axioms in question, are called extended distributive contact lattices. In this paper we consider several logics, corresponding to EDCL. We give completeness theorems with respect to both algebraic and topological semantics for these logics. It turns out that they are decidable. (shrink)

Generalizations of Boolean elements of a BL-algebra L are studied. By utilizing the MV-center MV(L) of L, it is reproved that an element x L is Boolean iff x x * = 1. L is called semi-Boolean if for all x L, x * is Boolean. An MV-algebra L is semi-Boolean iff L is a Boolean algebra. A BL-algebra L is semi-Boolean iff L is an SBL-algebra. A BL-algebra L is (...) called hyper-Archimedean if for all x L, xn is Boolean for some finite n 1. It is proved that hyper-Archimedean BL-algebras are MV-algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV-algebras or BL-algebras. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

This paper investigates the principles that one must add to Boolean algebra to capture reasoning not only about intersection, union, and complementation of sets, but also about the relative size of sets. We completely axiomatize such reasoning under the Cantorian definition of relative size in terms of injections.

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of fusion and correct some technical errors in prominent (...) discussions of the axiomatization of mereology. We show the equivalence of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection between classical mereology and complete Boolean algebra by giving two "neutral" axiom sets which can be supplemented by one or the other of two simple axioms to yield the full theories; one of these uses a notion of "strong complement" that helps explicate the connections between the theories. (shrink)

The starting point for studying the Croatian constitutional democracy is the adoption of the Constitution of the Republic of Croatia on 22 December 1990. The said Constitution defines the system of government as semi-presidential and its authors state as their model the Constitution of the Fifth Republic. However, the importing, in 1990, of French constitutional provisions was not neutral since the original French constitutional text was stripped of institutional obstacles, constitutional institutions for opposing the will of the President of (...) the Republic, constitutional-law conditions for the Prime Minister's primacy in the political system in case of co-habitation and discrepancies between the parliamentary and the presidential majority. The text was complemented by constitutional norms unknown to the original. French constitutional norms had to be put to good use, interpreted in line with and legally adapted to the desired political goal, i.e., the establishment of an effective state government in which the primacy of the President of the Republic would assert itself over both the Government and the legislature. The myth on the semi-presidential system was drawn on for both the adoption of the provisions regulating the organisation of government in the 1990 Constitution of the Republic of Croatia and their amendment in 2000. (shrink)

We define the set of double complemented elements in BL-algebras and state and prove some theorems which determines properties of these sets. We introduce the notion of an almost top element and study the properties of these elements.

The hexagonal structure for ‘the geometry of logical opposition’, as coming from Aristoteles–Apuleius square and Sesmat–Blanché hexagon, is presented here in connection with, on the one hand, geometrical ideas on duality on triangles (construction of ‘companion’), and on the other hand, constructions of tripartitions, emphasizing that these are exactly cases of borromean objects. Then a new case of a logical interest introduced here is the double magic tripartition determining the semi-ring ${\mathcal{B}_3}$ and this is a borromean object again, in (...) the heart of the semi-ring ${{\rm Mat}_{3}(\mathbb{B}_{\rm Alg})}$ . With this example we understand better in which sense the borromean object is a deepening of the hexagon, in a logical vein. Then, and this is our main objective here, the Post-Mal’cev full iterative algebra ${\mathbb{P}_4 = \mathbb{P}(\mathbb{F}_4)}$ of functions of all arities on ${\mathbb{F}_4}$ , is proved to be a borromean object, generated by three copies of ${\mathbb{P}_2}$ in it. This fact is induced by a hexagonal structure of the field ${\mathbb{F}_4}$ . This hexagonal structure is seen as precisely a geometrical addition to standard boolean logic, exhibiting ${\mathbb{F}_4}$ as a ‘boolean manifold’. This structure allows to analyze also ${\mathbb{P}_4}$ as generated by adding to a boolean set of logical functions a very special modality, namely the Frobenius squaring map in ${\mathbb{F}_4}$ . It is related to the splitting of paradoxes, to modified logic, to specular logic. It is a setting for a theory of paradoxical sentences, seen as computations of movements on the bi-hexagonal link among the 12 classical logics on a set of 4 values. (shrink)

This paper puts forth a class of algebraic structures, relativized Boolean algebras (RBAs), that provide semantics for propositional logic in which truth/validity is only defined relative to a local domain. In particular, the join of an event and its complement need not be the top element. Nonetheless, behavior is locally governed by the laws of propositional logic. By further endowing these structures with operators—akin to the theory of modal Algebras—RBAs serve as models of modal logics in which truth is (...) relative. In particular, modal RBAs provide semantics for various well-known awareness logics and an alternative view of possibility semantics. (shrink)

This book extends the concept of linguistic coordinate geometry using linguistic planes or semi-linguistic planes. In the case of coordinate planes, we are always guaranteed of the distance between any two points in that plane. However, in the case of linguistic and semi-linguistic planes, we can not always determine the linguistic distance between any two points. This is the first limitation of linguistic planes and semi-linguistic planes.

Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...) computer scientists interested in developing very simple computer languages rich enough for mathematical and scientific applications. The authors show that set theory and number theory can be developed within the framework of a new, different, and simple equational formalism, closely related to the formalism of the theory of relation algebras. There are no variables, quantifiers, or sentential connectives. Predicates are constructed from two atomic binary predicates (which denote the relations of identity and set-theoretic membership) by repeated applications of four operators that are analogues of the well-known operations of relative product, conversion, Boolean addition, and complementation. All mathematical statements are expressed as equations between predicates. There are ten logical axiom schemata and just one rule of inference: the one of replacing equals by equals, familiar from high school algebra. Though such a simple formalism may appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics. The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; first-order logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic. (shrink)

This paper treats some of the issues raised by Putnam's discussion of, and claims for, quantum logic, specifically: that its proposal is a response to experimental difficulties; that it is a reasonable replacement for classical logic because its connectives retain their classical meanings, and because it can be derived as a logic of tests. We argue that the first claim is wrong (1), and that while conjunction and disjunction can be considered to retain their classical meanings, negation crucially does not. (...) The argument is conducted via a thorough analysis of how the meet, join and complementation operations are defined in the relevant logical structures, respectively Boolean- and ortholattices (3). Since Putnam wishes to reinstate a realist interpretation of quantum mechanics, we ask how quantum logic can be a logic of realism. We show that it certainly cannot be a logic of bivalence realism (i.e., of truth and falsity), although it is consistent with some form of ontological realism (4). Finally, we show that while a reasonable explication of the idealized notion of test yields interesting mathematical structure, it by no means yields the rich ortholattice structure which Putnam (following Finkelstein) seeks. (shrink)