The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar inequalities exist in algebras of multi-valued logic when the multiplication and addition operations are replaced with various T-norms and T-conorms respectively. For instance, we show that the rearrangement inequality holds when the T-norms and T-conorms are derived from Archimedean copulas.

In the recent years, problem-solving become a central topic that discussed by educators or researchers in mathematics education. it’s not only as the ability or as a method of teaching. but also, it is a little in reviewing about the components of the support to succeed in problem-solving, such as student's belief and attitude towards mathematics, algebraic thinking skills, resources and teaching materials. In this paper, examines the algebraic thinking skills as a foundation for problem-solving, and learning cycle as a (...) breath of continuous learning. In this paper, learning cycle to be used is a modified type of 5E based on beliefs. (shrink)

Most approaches to quantum gravity suggest that relativistic spacetime is not fundamental, but instead emerges from some non-spatiotemporal structure. This paper investigates the implications of this suggestion for the possibility of time travel in the sense of the existence of closed timelike curves in some relativistic spacetimes. In short, will quantum gravity reverse or strengthen general relativity’s verdict that time travel is possible?

This paper deals with one kind of Kripke-style semantics, which we shall call algebraic Kripke-style semantics, for relevance logics. We first recall the logic R of relevant implication and some closely related systems, their corresponding algebraic structures, and algebraic completeness results. We provide simpler algebraic completeness proofs. We then introduce various types of algebraic Kripke-style semantics for these systems and connect them with algebraic semantics.

“If the tower is any taller than 320 ms, it may collapse,” Eiffel thinks out loud. Although understanding this counterfactual poses no trouble, the most successful interventionist semantics struggle to model it because the antecedent can come about in infinitely many ways. My aim is to provide a semantics that will make modeling such counterfactuals easy for philosophers, computer scientists, and cognitive scientists who work on causation and causal reasoning. I first propose three desiderata that will guide my theory: it (...) should be general, yet conservative, yet useful. Next, I develop a formalization of events in the form of an algebra. I identify an event with all the ways in which it can be brought about and provide rules for determining the referent of an arbitrary event description. I apply this algebra to counterfactuals expressed using underdeterministic causal models-models that encode non-probabilistic causal indeterminacies. Specifically, I develop semaphore interventions, which represent how the target system may be modified from without in a coordinated fashion. This, in turn, allows me to bring about any event within a single model. Finally, I explain the advantages of this semantics over other interventionist competitors. (shrink)

We construct and study structures imitating the field of complex numbers with exponentiation. We give a natural, albeit non first-order, axiomatisation for the corresponding class of structures and prove that the class has a unique model in every uncountable cardinality. This gives grounds to conjecture that the unique model of cardinality continuum is isomorphic to the field of complex numbers with exponentiation.

The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by the Curry (...) combinator in lambda calculus) diagonal fixed points in a class of partially ordered algebras which covers both combinatory spaces of Skordev and operative spaces of Ivanov. Especially, this yields an essential improvement of the axiomatization of recursion theory via combinatory spaces. (shrink)

LetKbe an algebraic number field andIKthe ring of algebraic integers inK. *Kand *IKdenote enlargements ofKandIKrespectively. LetxЄ *K–K. In this paper, we are concerned with algebraic extensions ofKwithin *K. For eachxЄ *K–Kand each natural numberd, YKis defined to be the number of algebraic extensions ofKof degreedwithin *K.xЄ *K–Kis called a Hilbertian element ifYK= 0 for alldЄ N,d> 1; in other words,Khas no algebraic extension within *K. In their paper [2], P. C. Gilmore and A. Robinson proved that the existence of a (...) Hilbertian element is equivalent to Hilbert's irreducibility theorem. In a previous paper [9], we gave many Hilbertian elements of nonstandard integers explicitly, for example, for any nonstandard natural numberω, 2ωPωand 2ω are Hilbertian elements in*Q, where pωis theωth prime number. (shrink)

Here algebraic Routley-Meyer semantics is addressed for two fuzzy versions of the logic of relevant implication R. To this end, two versions R t and R T of R and their fuzzy extensions FRt and FRT , respectively, are first discussed together with their algebraic semantics. Next algebraic Routley-Meyer semantics for these two fuzzy extensions is introduced. Finally, it is verified that these logics are sound and complete over the semantics.

The semantics of directional prepositions is investigated from the perspective of aspect. What distinguishes telic PPs (like to the house) from atelic PPs (like towards the house), taken as denoting sets of paths, is their algebraic structure: atelic PPs are cumulative, closed under the operation of concatenation, telic PPs are not. Not only does this allow for a natural and compositional account of how PPs contribute to the aspect of a sentence, but it also guides our understanding of the lexical (...) semantics of prepositions in important ways. Semantically, prepositions turn out to be quite similar to nouns and verbs. Nominal distinctions (like singular and plural, mass and count) and verbal classes (like semelfactives and degree achievements) have their prepositional counterparts. (shrink)

Recently Shakurov pioneered the study of subalgebras of diagonalizable algebras of theories of arithmetic. We show that his results extend to weaker theories.

Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in Göttingen in 1921 with a thesis on the decision problem. In his thesis, he solved - independently of Löwenheim and Skolem's earlier work - the decision problem for monadic second-order logic in a framework that combined elements of the algebra of logic and the newer axiomatic approach to logic then being developed in Göttingen. In a talk given in 1921, he outlined this solution, but also presented important programmatic remarks on (...) the significance of the decision problem and of decision procedures more generally. The text of this talk as well as a partial English translation are included. (shrink)

We construct a sheaf-theoretic representation of quantum probabilistic structures, in terms of covering systems of Boolean measure algebras. These systems coordinatize quantum states by means of Boolean coefficients, interpreted as Boolean localization measures. The representation is based on the existence of a pair of adjoint functors between the category of presheaves of Boolean measure algebras and the category of quantum measure algebras. The sheaf-theoretic semantic transition of quantum structures shifts their physical significance from the orthoposet axiomatization at (...) the level of events, to the sheaf-theoretic gluing conditions at the level of Boolean localization systems. (shrink)

Neutrosophic set is a new mathematical tool for handling problems involving imprecise, indetermi nacy and inconsistent data. Pseudo-BCI algebra is a kind of non-classical logic algebra in close connection with various non-commutative fuzzy logics. Recently, we applied neutrosophic set theory to pseudo-BCI al gebras. In this paper, we study neutrosophic filters in pseudo-BCI algebras. The concepts of neutrosophic regular filter, neutrosophic closed filter and fuzzy regular filter in pseudo-BCI algebras are introduced, and some basic properties are discussed. Moreover, (...) the relationships among neutrosophic regular filter, fuzzy filters and anti-grouped neutrosophic filters are prese nted, and the results are proved: a neutrosophic filter (fuzzy filter) is a neutrosophic regular filter (fuzzy regular filter), if and only if it is both a neutrosophic closed filter (fuzzy closed filter) and an anti-grouped neutrosophic filter (fuzzy anti-grouped filter). (shrink)

In this paper, we define the notions of (l,r)-symmetric bi-derivations and (r,l)-symmetric bi-derivations on UP-algebras and investigate some properties of them. For these derivations, we introduce the sets Kerd(U), Fixd(U) and FixD(U). Moreover, we examine with examples whether these sets are UP-subalgebra or UP-ideal.

We study the flow of trigonalizable algebraic group acting on its type space, focusing on the problem raised in [17] of whether weakly generic types coincide with almost periodic types if the group has global definable f‐generic types, equivalently whether the union of minimal subflows of a suitable type space is closed. We shall give a description of f‐generic types of trigonalizable algebraic groups, and prove that every f‐generic type is almost periodic.

This paper studies categories and functors in the context of reverse and computable mathematics. In ordinary reverse mathematics, we only focuses on categories whose objects and morphisms can be represented by natural numbers. We first consider morphism sets of categories and prove several associated theorems equivalent to $$\mathrm ACA_{0}$$ over the base system $$\mathrm RCA_{0}$$. The Yoneda Lemma is a basic result in category theory and homological algebra. We then develop an effective version of the Yoneda Lemma in $$\mathrm RCA_{0}$$ (...) ; as an application, we formalize an effective version of the Yoneda Embedding in $$\mathrm RCA_{0}$$. Products and coproducts are basic notions for defining special categories like semi-additive categories and additive categories. We study properties of products and coproducts of a sequence of objects of categories and provide effective characterizations of semi-additive categories and additive categories in terms of products and coproducts. Finally, we further consider the strength of theorems of category theory that are studied in this paper by methods of higher-order reverse mathematics. (shrink)

The overwhelming majority of the attempts in exploring the problems related to quantum logical structures and their interpretation have been based on an underlying set-theoretic syntactic language. We propose a transition in the involved syntactic language to tackle these problems from the set-theoretic to the category-theoretic mode, together with a study of the consequent semantic transition in the logical interpretation of quantum event structures. In the present work, this is realized by representing categorically the global structure of a quantum algebra (...) of events (or propositions) in terms of sheaves of local Boolean frames forming Boolean localization functors. The category of sheaves is a topos providing the possibility of applying the powerful logical classification methodology of topos theory with reference to the quantum world. In particular, we show that the topos-theoretic representation scheme of quantum event algebras by means of Boolean localization functors incorporates an object of truth values, which constitutes the appropriate tool for the definition of quantum truth-value assignments to propositions describing the behavior of quantum systems. Effectively, this scheme induces a revised realist account of truth in the quantum domain of discourse. We also include an Appendix, where we compare our topos-theoretic representation scheme of quantum event algebras with other categorial and topos-theoretic approaches. (shrink)

Most contemporary chemists consider quantum mechanics to be the foundational theory of their discipline, although few of the calculations that a strict reduction would seem to require have ever been produced. In this essay I discuss contemporary algebraic and diagrammatic representations of molecular systems derived from quantum mechanical models, specifically configuration interaction wavefunctions for ab initio calculations and molecular orbital energy diagrams. My aim is to suggest that recent dissatisfaction with reductive accounts of chemical theory may stem from both the (...) inability of standard accounts of reduction to incorporate the diverse forms of representation found in chemical practice and our philosophical predilection to analyze all connections between theories in terms of logical reduction. (shrink)

The cut and choose game is one of the infinitary games on a complete Boolean algebra B introduced by Jech. We prove that existence of a winning strategy for II in implies semiproperness of B. If the existence of a supercompact cardinal is consistent then so is “for every 1-distributive algebra B II has a winning strategy in ”.

We define a Lie differential field as a field of characteristic 0 with an action, as derivations on , of some given Lie algebra . We assume that is a finite-dimensional vector space over some sub-field given in advance. As an example take the field of rational functions on a smooth algebraic variety, with .For every simple extension of Lie differential fields we find a finite system of differential equations that characterizes it. We then define, using first-order conditions, a collection (...) of allowed systems of differential equations s.t. the above characteristic systems are allowed. We prove that for every allowed system there exists a generic solution in some extension, and this solution is unique .We construct the model completion of the theory of Lie differential fields by adding axioms stating that every allowed system has almost generic solutions. The construction is a generalization of Blum's axioms for DCF0. We also show that this model completion is ω-stable. (shrink)

In this presentation, I first outline three different notions of concepts: one derives from Leibniz, while the other two derive from Frege. The Leibnizian notion is the subject of his “calculus of concepts” (which is really an algebra). One notion of concept from Frege is what we would call a “property”, so that when Frege says “x falls under the concept F”, we would say “x instantiates F” or “x exemplifies F”. The other notion of concept from Frege is that (...) of the notion of sense, which played various roles within Frege's theory. This notion of concept can be generalized and, as such, accounts for our intuitive talk of “x's concept of …”, where the ellipsis can be filled in with a name for individual, a property, or a relation, etc. After outlining these three notions, I then discuss how (axiomatic) object theory offers a distinct, precise regimentation of each of the three notions. (shrink)

This book is a tribute to Professor Ewa Orłowska, a Polish logician who was celebrating the 60th year of her scientific career in 2017. It offers a collection of contributed papers by different authors and covers the most important areas of her research. Prof. Orłowska made significant contributions to many fields of logic, such as proof theory, algebraic methods in logic and knowledge representation, and her work has been published in 3 monographs and over 100 articles in internationally acclaimed journals (...) and conference proceedings. The book also includes Prof. Orłowska’s autobiography, bibliography and a trialogue between her and the editors of the volume, as well as contributors' biographical notes, and is suitable for scholars and students of logic who are interested in understanding more about Prof. Orłowska’s work. (shrink)

This dissertation is based on the compositional model theoretic approach to natural language semantics that was initiated by Montague (1970) and developed by subsequent work. In this general approach, coordination and negation are treated following Keenan & Faltz (1978, 1985) using boolean algebras. As in Barwise & Cooper (1981) noun phrases uniformly denote objects in the boolean domain of generalized quanti®ers. These foundational assumptions, although elegant and minimalistic, are challenged by various phenomena of coordination, plurality and scope. The dissertation (...) solves these problems by developing a ¯exible process of meaning composition, as ®rst proposed by Partee & Rooth (1983). Flexible interpretation involves semantic operations without any phonological counterpart, which participate in the interpretation process and change meanings of overt expressions. The dissertation introduces a novel ¯exible system where a small number of operations describe the behaviour of complex phenomena such as `non-boolean' and, the scope of inde®nites and the semantics of collectivity with quanti®cational NPs. The proposed theory is based on a distinction between two features of meanings in natural language. (shrink)

Homologous operational localization processes are effectuated in terms of generalized topological covering systems on structures of physical events. We study localization systems of quantum events' structures by means of Gtothendieck topologies on the base category of Boolean events' algebras. We show that a quantum events algebra is represented by means of a Grothendieck sheaf-theoretic fibred structure, with respect to the global partial order of quantum events' fibres over the base category of local Boolean frames.

It is possible today to observe in hindsight the epistemological landscape of the twentieth century, and the work of Albert Lautman in mathematical philosophy appears as a profound turning point, opening to a true under- standing of creativity in mathematics and its relation with the real. Little understood in its time or even today, Lautman’s work explores the difficult but exciting intersection where modern mathematics, advanced mathe- matical invention, the structural or unitary relations of mathematical knowledge and, finally, the metaphysical (...) and dialectical tensions underly- ing mathematical activity converge. Well beyond other better-known names in philosophy of mathematics – who are focused above all on ques- tions concerning the logical problem of foundations, important but frag- mentary studies in the vast panorama of modern mathematics – Lautman broaches the emergence of inventiveness in the very broad spectrum of the development of the mathematical real. Group theory, differential geome- try, algebraic topology, differential equations, functional analysis, functions of complex variables and number fields are some of the domains of his preferred examples. He detects in them methods of construction, structu- ration and unification of modern mathematics that he connects to a precise Platonic interpretation in which powerful pairs of ideas serve to organize the edifice of effective mathematics. (shrink)

Humans are standouts in their propensity to trade. More specially, the kind of trading found in humans—featuring the exchange of many different goods and services with many different others, for the mutual benefit of all the involved parties—far exceeds anything that is found in any other creature. However, a number of important questions about this propensity remain open. First, it is not clear exactly what makes this propensity so different in the human case from that of other animals. Second, it (...) is not clear why other animals did not acquire this propensity to the extent that humans did. Third, it is not clear what explains the fact that the extent to which humans engage in trade is culturally highly variable. The paper argues that at the heart of the human-animal divergence in this propensity is the particular socio-cultural environment in which humans evolved. This has led them to sometimes, but not always, acquire the cognitive technology (writing, algebra, tallying devices, money, etc.) to support a sophisticated disposition and capacity for reciprocal cooperation, and deep and wide concepts of property and exchange value. (shrink)

In the present study, inspired by the studies in the literature, we consider Min matrix and its Hadamard exponential matrix family whose elements are Chebyshev polynomials of the first kind. Afterwards, we examine their various linear algebraic properties and obtain some inequalities. Furthermore, we shed light on the results we obtained to boost the clarity of our paper with the illustrative examples. In addition to all these, we give two MATLAB-R2023a codes that compute the Min matrix and the Hadamard exponential (...) matrix with Chebyshev polynomials of the first kind entries, as well as calculate some matrix norms. (shrink)

In this paper we dene a concept of depth of a consequence operation which seems to have a few useful properties. To make our denition worth- while we shall show that the concept of depth leads to a strengthening of the well-known theorem of R. Wojcicki [4]. For unexplained terminology and notations we refer the reader to R. Wojcicki [5]. Algebras and matrices con- sidered in this paper are of the same similarity type indicating a sequence of nitary operations.

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...) categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

The notion of an instrument in the quantum theory of measurement is studied in the context of transformation valued linear maps on von Neumann algebras and their *-subalgebras. An extension theorem is proved which yields among other things characterizations of the Fourier transforms of instruments and their noncommutative analogues. As an application, an ergodic type theorem for a general class of transformation valued functions on a locally compact group is obtained.

Orthologic is defined by weakening the axioms and rules of inference of the classical propositional calculus. The resulting Lindenbaum-Tarski quotient algebra is an orthoimplication algebra which generalizes the author's implication algebra. The associated order structure is a semi-orthomodular lattice. The theory of orthomodular lattices is obtained by adjoining a falsity symbol to the underlying orthologic or a least element to the orthoimplication algebra.

The book is a collection of papers and aims to unify the questions of syntax and semantics of language, which are included in logic, philosophy and ontology of language. The leading motif of the presented selection of works is the differentiation between linguistic tokens (material, concrete objects) and linguistic types (ideal, abstract objects) following two philosophical trends: nominalism (concretism) and Platonizing version of realism. The opening article under the title “The Dual Ontological Nature of Language Signs and the Problem of (...) Their Mutual Relations” provides a broad introduction into the problem area connected with this differentiation, while the logic-formal characteristics of the distinction are framed in the work entitled “On the Type-Token Relationships” (Chapter 1). The basic part of the book deals with issues relating to syntax (Chapters 2-4) and semantics of language (Chapters 5-6), as well as pertaining to syntactic-semantic pragmatic questions (Chapters 7-13). Throughout the book, language, categorial language, is characterized syntactically as generated by classical categorial grammar (Chapter 2) and formalized on two opposing levels: as language of expression-tokens (level of tokens) and language of expression-types (level of types). The author’s considerations contained in Chapters 2 and 4 lead to the important philosophical conclusion that in formal-logical syntactic studies on language the assumption that expression-types constitute the primary language layer while expression-tokens make the secondary one, can be neglected; thus, this speaks in favour of the opposing standpoint—the concretistic one—in the ontology of language syntax. In the works “Meaning and Interpretations”, Parts I and II (Chapters 5 and 6), it is underlined, however, that such semantic concepts as: meaning, denotation and interpretation are defined on the types level, yet their formal definitions require making use of notions of the tokens level. The semantic notions introduced in the above-mentioned articles are also used in the following works of the present selection, under the titles: “Three Principles of Compositionality” and “On Metaknowledge and Truth” (Chapters 7 and 8). They formalize two principles of compositionality that are well known in the literature on the subject, deriving from Frege, i.e. those of meaning and of denotation; they are related to the syntactic principle of compositionality which was introduced by the author. All the three principles are, at the same time, three conditions of homomorphism of categorial language algebra into three kinds of non-standard models of language (one syntactic and two semantic ones: intensional and extensional), which allows introducing three definitions of truthfulness into these models. The next two works in the collection, entitled: “On Language Adequacy” and “What is the Sense in Logic and Philosophy of Language” (Chapters 9 and 10) concern adequacy of categorial language syntax along with its dual semantics: intensional and extensional, and categorial compatibility of any of its syntactic categories with two corresponding semantic categories: intensional and extensional, based on the compatibility the syntactic category of each language expression with the ontological category assigned to its denotatum. The well-known problem of categorial compatibility for first-order quantifiers finds its solution in the paper “Categories of First-Order Quantifiers” (Chapter 11). In the work “Logic and Ontology of Language” (Chapter 12), being in a sense a summary of the considerations presented in the preceding chapters of the book, language is treated as an ontological being, characterized in compliance with the logical conception of language proposed by Ajdukiewicz. Application—like throughout the book—of tools of classical logic and set theory has resulted in emergence of a general formal logical theory of syntax, semantics and pragmatics of language, which takes into account duality in the understanding of linguistic expressions as tokens (concretes) and types (abstract objects). In terms that take into account a functional approach to language itself, there comes out an ontological neutrality of logic with respect to existential assumptions relating to the ontological nature of linguistic expressions and their extra-linguistic ontological counterparts. The issues connected with applying logic while explaining the manner of using linguistic tokens and linguistic types to determine notions of language communication are raised and illustrated in the last chapter of the work, bearing the title “A Logical Conceptualization of Knowledge on the Notion of Language Communication”. (shrink)

In this work we provide a new topological representation for implication algebras in such a way that its one-point compactification is the topological space given in [1]. Some applications are given thereof.

In the paper, various notions of the logical semiotic sense of linguistic expressions – namely, syntactic and semantic, intensional and extensional – are considered and formalised on the basis of a formal-logical conception of any language L characterised categorially in the spirit of certain Husserl's ideas of pure grammar, Leśniewski-Ajdukiewicz's theory of syntactic/semantic categories and, in accordance with Frege's ontological canons, Bocheński's and some of Suszko's ideas of language adequacy of expressions of L. The adequacy ensures their unambiguous syntactic and (...) semantic senses and mutual, syntactic and semantic correspondence guaranteed by the acceptance of a postulate of categorial compatibility of syntactic and semantic (extensional and intensional) categories of expressions of L. This postulate defines the unification of these three logical senses. There are three principles of compositionality which follow from this postulate: one syntactic and two semantic ones already known to Frege. They are treated as conditions of homomorphism of partial algebra of L into algebraic models of L: syntactic, intensional and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, obviously, an idealisation. The syntactic and semantic unambiguity of its expressions is not, of course, a feature of natural languages, but every syntactically and semantically ambiguous expression of such languages may be treated as a schema representing all of its interpretations that are unambiguous expressions. (shrink)

In this paper we prove that the free algebras in a subvariety equation image of the variety equation image of semi-Heyting algebras are directly decomposable if and only if equation image satisfies the Stone identity.

A biresiduation algebra is a 〈/,\,1〉-subreduct of an integral residuated lattice. These algebras arise as algebraic models of the implicational fragment of the Full Lambek Calculus with weakening. We axiomatize the quasi-variety B of biresiduation algebras using a construction for integral residuated lattices. We define a filter of a biresiduation algebra and show that the lattice of filters is isomorphic to the lattice of B-congruences and that these lattices are distributive. We give a finite basis of terms for (...) generating filters and use this to characterize the subvarieties of B with EDPC and also the discriminator varieties. A variety generated by a finite biresiduation algebra is shown to be a subvariety of B. The lattice of subvarieties of B is investigated; we show that there are precisely three finitely generated covers of the atom. (shrink)

This paper deals with substructural nuclear (image-based) logics and their algebraic and Kripke-style semantics. More precisely, we first introduce a class of substructural logics with connective _N_ satisfying nucleus property, called here substructural _nuclear_ logics, and its subclass, called here substructural _nuclear image-based_ logics, where _N_ further satisfies homomorphic image property. We then consider their algebraic semantics together with algebraic characterizations of those logics. Finally, we introduce _operational Kripke-style_ semantics for those logics and provide two sorts of completeness results for (...) them, one of which is based on algebraic completeness for all the logics and the other of which is based on set-theoretic one for the nuclear image-based logics. (shrink)