Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)

Multisets are ‘sets’ in which elements may occur multiple times. Discrete probability distributions capture states in which elements may occur with probabilities that add up to one. This paper describes how the interaction between multisets and distributions lies at the heart of some basic constructions in probability theory, especially in distributions arising from drawing from an urn with multiple balls and in learning distributions from multiple occurrences of data. Drawing multiple balls from an urn is described uniformly in (...) terms of Kleisli iteration for a monad, covering the four standard distinctions of ordered/unordered draws, with/without replacement. In probabilistic learning the paper distinguishes two forms of likelihood, based on also on iteration, with corresponding forms of learning. Both of these forms occur in the literature, but they are not clearly distinguished, even though they lead to different outcomes. (shrink)

We consider finite multisets over some set of urelements equipped only with additive union [uplus ] and show that the {[otimes], -0}-Horn fragment of Intuitionistic Linear Logic has a sound and complete interpretation in them by interpreting [otimes] as [uplus ]. The linear implication is interpreted by ordered pairs of multisets expressing replacement. The operator ! is also defined in an asymptotic way. Soundness, completeness and partial completeness results are proved for the {×, -0, !}-Horn fragment as well.

We continue our work [5] on the logic of multisets (or on the multiset semantics of linear logic), by interpreting further the additive disjunction . To this purpose we employ a more general class of processes, called free, the axiomatization of which requires a new rule (not compatible with the full LL), the cancellation rule. Disjunctive multisets are modeled as finite sets of multisets. The -Horn fragment of linear logic, with the cut rule slightly restricted, is sound (...) with respect to this semantics. Another rule, which is a slight modification of cancellation, added to HF makes the system sound and complete. (shrink)

An axiomatic account of multiset theory is given, where multiplicities are of the same sort as sets. Various theories are proposed covering different existing multiset systems, as well as a stronger theory which is equiconsistent with Zermelo–Fraenkel set theory and with antifoundation. The inclusion relation receives a recursive definition in terms of membership and is shown to be not always antisymmetric.

We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order typeω,ω2orωω. We show that a familiar construction gives rise to continuum many such orderings of order typeω. We construct a new family of such orderings of order typeω2, and show that there are continuum many of these. We show that there are only four such orderings (...) of order typeωω, the two familiar recursive path orderings and two closely related orderings. We consider also total well-founded orderings onNnwhich are preserved under vector addition. We show that any such ordering must have order typeωkfor some 1 ≤k≤n. We show that ifkshrink)

We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order type $\omega, \omega^2$ or $\omega^\omega$. We show that a familiar construction gives rise to continuum many such orderings of order type $\omega$. We construct a new family of such orderings of order type $\omega^2$, and show that there are continuum many of these. We show that (...) there are only four such orderings of order type $\omega^\omega$, the two familiar recursive path orderings and two closely related orderings. We consider also total well-founded orderings on $\mathbf{N}^n$ which are preserved under vector addition. We show that any such ordering must have order type $\omega^k$ for some $1 \leq k \leq n$. We show that if $k < n$ there are continuum many such orderings, and if $k = n$ there are only $n$!, the $n$! lexicographic orderings. (shrink)

In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially different universes of such sets. The unisets of the first universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular multisets and arbitrary trees. RID=""ID="" Mathematics Subject Classification (2000): 03B45, 03E65, 03E70, (...) 18A15, 18A22, 18B05, 68Q85 RID=""ID="" Key words or phrases: Multiset – Non-wellfounded set – Scott-universe – AFA – Coalgebra – Modal logic – Graded modalities. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued (...) trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; (...) inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (shrink)

We generalise the Blok–Jónsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and Jónsson admit, in place of sheer formulas, a wider range of syntactic units to be manipulated in deductions (including sequents or equations), these objects are invariablyaggregatedvia set-theoretical union. Our approach is more general in that nonidempotent forms of premiss and conclusion aggregation, including multiset sum and fuzzy set union, are considered. (...) In their abstract form, thus,deductive relationsare defined as additional compatible preorderings over certain partially ordered monoids. We investigate these relations using categorical methods and provide analogues of the main results obtained in the general theory of consequence relations. Then we focus on the driving example of multiset deductive relations, providing variations of the methods of matrix semantics and Hilbert systems in Abstract Algebraic Logic. (shrink)

We now found nine new topologies, such as: NonStandard Topology, Largest Extended NonStandard Real Topology, Neutrosophic Triplet Weak/Strong Topologies, Neutrosophic Extended Triplet Weak/Strong Topologies, Neutrosophic Duplet Topology, Neutrosophic Extended Duplet Topology, Neutrosophic MultiSet Topology, and recall and improve the seven previously founded topologies in the years (2019-2023), namely: NonStandard Neutrosophic Topology, NeutroTopology, AntiTopology, Refined Neutrosophic Topology, Refined Neutrosophic Crisp Topology, SuperHyperTopology, and Neutrosophic SuperHyperTopology. They are called avantgarde topologies because of their innovative forms.

We provide a general investigation of Logic in which the notion of a simple consequence relation is taken to be fundamental. Our notion is more general than the usual one since we give up monotonicity and use multisets rather than sets. We use our notion for characterizing several known logics (including Linear Logic and non-monotonic logics) and for a general, semantics-independent classi cation of standard connectives via equations on consequence relations (these include Girard's \multiplicatives" and \additives"). We next investigate (...) the standard methods for uniformly representing consequence relations: Hilbert type, Natural Deduction and Gentzen type. The advantages and disadvantages of using each system and what should be taken as.. (shrink)

We present a new frame semantics for positive relevant and substructural propositional logics. This frame semantics is both a generalisation of Routley–Meyer ternary frames and a simplification of them. The key innovation of this semantics is the use of a single accessibility relation to relate collections of points to points. Different logics are modeled by varying the kinds of collections used: they can be sets, multisets, lists or trees. We show that collection frames on trees are sound and complete (...) for the basic positive distributive substructural logic $\mathsf {B}^+$, that collection frames on multisets are sound and complete for $\mathsf {RW}^+$ (the relevant logic $\mathsf {R}^+$, without contraction, or equivalently, positive multiplicative and additive linear logic with distribution for the additive connectives), and that collection frames on sets are sound for the positive relevant logic $\mathsf {R}^+$. The completeness of set frames for $\mathsf {R}^+$ is, currently, an open question. (shrink)

An exclusive disjunction is true when exactly one of the disjuncts is true. In the case of the familiar binary exclusive disjunction, we have a formula occurring as the first disjunct and a formula occurring as the second disjunct, so, if what we have is two formula-tokens of the same formula-type—one formula occurring twice over, that is—the question arises as to whether, when that formula is true, to count the case as one in which exactly one of the disjuncts is (...) true, counting by type, or as a case in which two disjuncts are true, counting by token. The latter is the standard answer: counting by tokens. James McCawley once suggested that, when the exclusively disjunctive construction in natural language is at issue, the construction should be treated as involving a multigrade connective whose semantic treatment is sensitive to the set of disjuncts rather than the corresponding multiset. Without any commitment as to whether there actually is such a construction, and conceding that for obvious pragmatic reasons such ‘repeated disjunct’ cases would be at best highly marginal, we note that for the binary case, this requires a nonstandard answer—count by type rather than by token—to the earlier question, and thus, an idempotent exclusive disjunction connective. Section 2 explores that idea and Section 3, a further idempotent variant for which it is the propositions expressed by the disjuncts, rather than the disjuncts themselves, that get counted once only in the case of repetitions. Sections 1 and 4 respectively set the stage for these investigations and conclude the discussion. More detailed considerations of points arising from the discussion but otherwise in danger of interrupting the flow are deferred to a ‘Longer Notes’ appendix at the end. (shrink)

We show how to embed a framework for multilateral negotiation, in which a group of agents implement a sequence of deals concerning the exchange of a number of resources, into linear logic. In this model, multisets of goods, allocations of resources, preferences of agents, and deals are all modelled as formulas of linear logic. Whether or not a proposed deal is rational, given the preferences of the agents concerned, reduces to a question of provability, as does the question of (...) whether there exists a sequence of deals leading to an allocation with certain desirable properties, such as maximising social welfare. Thus, linear logic provides a formal basis for modelling convergence properties in distributed resource allocation. (shrink)

In this paper we first develop a logic independent account of relevant implication. We propose a stipulative denition of what it means for a multiset of premises to relevantly L-imply a multiset of conclusions, where L is a Tarskian consequence relation: the premises relevantly imply the conclusions iff there is an abstraction of the pair such that the abstracted premises L-imply the abstracted conclusions and none of the abstracted premises or the abstracted conclusions can be omitted while still maintaining valid (...) L-consequence. Subsequently we apply this denition to the classical logic consequence relation to obtain NTR-consequence, i.e. the relevant CL-consequence relation in our sense, and develop a sequent calculus that is sound and complete with regard to relevant CL-consequence. We present a sound and complete sequent calculus for NTR. In a next step we add rules for an object language relevant implication to the sequent calculus. The object language implication reflects exactly the NTR-consequence relation. One can see the resulting logic NTR-> as a relevant logic in the traditional sense of the word. By means of a translation to the relevant logic R, we show that the presented logic NTR is very close to relevance logics in the Anderson-Belnap-Dunn-Routley-Meyer tradition. However, unlike usual relevant logics, NTR is decidable for the full language, Disjunctive Syllogism and Adjunction are valid, and neither Modus Ponens nor the Cut rule are admissible. (shrink)

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the (...) context of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input. (shrink)

In 1983, Valentini presented a syntactic proof of cut elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for “Valentini”. The sequents in GLSV were built from sets, as opposed to multisets, thus avoiding an explicit contraction rule. From a syntactic point of view, it is more satisfying and formal to explicitly identify the applications of the contraction rule that are ‘hidden’ in these set based proofs of cut elimination. There (...) is often an underly ing assumption that the move to a proof of cut elimination for sequents built from multisets is easy. Recently, however, it has been claimed that Valentini’s arguments to eliminate cut do not terminate when applied to a multiset formulation of GLSV with an explicit rule of contraction. The claim has led to much confusion and various authors have sought new proofs of cut elimination for GL in a multiset setting. Here we refute this claim by placing Valentini’s arguments in a formal setting and proving cut elimination for sequents built from multisets. The formal setting is particularly important for sequents built from multisets, in order to accurately account for the interplay between the weakening and contraction rules. Furthermore, Valentini’s original proof relies on a novel induction parameter called “width” which is computed ‘globally’. It is diffi cult to verify the correctness of his induction argument based on “width”. In our formulation however, verification of the induction argument is straight forward. Finally, the multiset setting also introduces a new complication in the the case of contractions above cut when the cut formula is boxed. We deal with this using a new transformation based on Valentini’s original arguments. Finally, we show that the algorithm purporting to show the non termi nation of Valentini’s arguments is not a faithful representation of the original arguments, but is instead a transformation already known to be insufficient. (shrink)

In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering ; and (ii) a scheme for symbolic backward reachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also present better quasi-ordered transition systems (...) which allow the design of efficient symbolic representations of infinite sets of states. (shrink)

We re-express our theorem on the strong-normalisation of display calculi as a theorem about the well-foundedness of a certain ordering on first-order terms, thereby allowing us to prove the termination of systems of rewrite rules. We first show how to use our theorem to prove the well-foundedness of the lexicographic ordering, the multiset ordering and the recursive path ordering. Next, we give examples of systems of rewrite rules which cannot be handled by these methods but which can be handled by (...) ours. Finally, we show that our method can also prove the termination of the Knuth-Bendix ordering and of dependency pairs. Keywords: rewriting, termination, well-founded ordering, recursive path ordering.. (shrink)

This note relates to two recent papers in the journal. The main point was to highlight Kempe's theory of multisets (as we now call them), especially in the background to the start of Peirce's theory of existential graphs.

In this paper, a metaphysics is proposed that includes everything that can be represented by a well-founded multiset. It is shown that this metaphysics, apart from being self-explanatory, is also benevolent. Paradoxically, it turns out that the probability that we were born in another life than our own is zero. More insights are gained by inducing properties from a metaphysics that is not self-explanatory. In particular, digital metaphysics is analyzed, which claims that only computable things exist. First of all, it (...) is shown that digital metaphysics contradicts itself by leading to the conclusion that the shortest computer program that computes the world is infinitely long. This means that the Church-Turing conjecture must be false. Secondly, the applicability of Occam’s razor is explained by evolution: in an evolving physics it can appear at each moment as if the world is caused by only finitely many things. Thirdly and most importantly, this metaphysics is benevolent in the sense that it organizes itself to fulfill the deepest wishes of its observers. Fourthly, universal computers with an infinite memory capacity cannot be built in the world. And finally, all the properties of the world, both good and bad, can be explained by evolutionary conservation. (shrink)

In this paper, I consider the connection between consequence relations and closure operations. I argue that one familiar connection makes good sense of some usual applications of consequence relations, and that a largeish family of familiar noncontractive consequence relations cannot respect this familiar connection.

This is a sequel article to [10] where a hypersequent calculus for some temporal logics of linear frames includingKt4.3and its extensions for dense and serial flow of time was investigated in detail. A distinctive feature of this approach is that hypersequents are noncommutative, i.e., they are finite lists of sequents in contrast to other hypersequent approaches using sets or multisets. Such a system in [10] was proved to be cut-free HC formalization of respective logics by means of semantical argument. (...) In this article we present an equivalent variant of this calculus for which a constructive syntactical proof of cut elimination is provided. (shrink)

Graphs are employed to define a variety of distance-based binary merging operators. We provide logical characterization results for each class of merging operators introduced and discuss the extension of this approach to the merging of sequences and multisets.

We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It is shown that these equivalences are still valid for the databases that store complex data elements obtained from the recursive nesting of record, list, set and multiset constructors. The major proof argument utilises properties of Brouwerian algebras.The equivalences have several consequences. Firstly, they provide new insights into databases that are not in first normal form. (...) Secondly, they characterise the implication of data dependencies in nested databases in purely logical terms. The database designer can take advantage of these equivalences to reduce database design problems to well-studied problems in Boolean propositional logic. Furthermore, relational database design solutions can be reused to solve problems for nested databases. (shrink)

A propositional framework of formal reasoning is proposed, which emphasises the pattern of entering and exiting context. Contexts are modelled by an algebraic structure which reflects the order and manner in which context is entered into and exited from.The equations of the algebra partitions context terms into equivalence classes. A formal semantics is defined, containing models that map equivalence classes of certain context terms to sets of interpretations of the formula language. The corresponding Hilbert system incorporates the algebraic equations as (...) axioms asserted in context.In semigroups of contexts, where combination of contexts is associative, finite ground algebraic equations correspond to contingent equivalence between certain logical formulas. Systems for sets and multisets of contexts are obtained by presenting their respective algebras as associativity plus finite ground equations. Soundness and completeness results are proved.Some contextual reasoning systems in the literature are inherently associative, and we present those as special cases. (shrink)

The deductive system in Boole's Laws of Thought (LT) involves both an algebra, which we call proto-Boolean, and a "general method in Logic" making use of that algebra. Our object is to elucidate these two components of Boole's system, to prove his principal results, and to draw some conclusions not explicit in LT. We also discuss some examples of incoherence in LT; these mask the genius of Boole's design and account for much of the puzzled and disparaging commentary LT has (...) received. Our evaluation of Boole's logical system does not differ substantially from that advanced in Hailperin's exhaustive study, Boole's Logic and Probability. Unlike the latter work, however, we make direct use of the polynomials native to LT rather than appealing to formalisms such as multisets and rings. (shrink)

The concept of measuring inconsistency in information was developed by John Grant in a 1978 paper in the context of first-order logic. For more than 20 years very little was done in this area until in the early 2000s a number of AI researchers started to formulate new inconsistency measures primarily in the context of propositional logic knowledge bases. The aim of this volume is to survey what has been done so far, to expand inconsistency measurement to other formalisms, to (...) connect it with related topics, and to provide ideas for further research in a topic that is particularly relevant now in view of the many inconsistencies in the massive amount of information available. The book contains 11 chapters. The first chapter, by John Grant, gives his original motivation for starting this field, explains why it was formulated in a highly mathematical manner, presents important material that was omitted from the original paper, and provides ideas about the use of dimensions in measuring inconsistency. The second chapter, by Matthias Thimm, is a survey that covers most of the research on inconsistency measures up to 2017. The other 9 chapters, all by experts either in inconsistency measures, or in the topic under consideration, or both, connect inconsistency measures with argumentation, disjunctive logic programming, fuzzy logic systems, modal logics, multiset representation, paraconsistent consequence, probabilistic logic, relational databases, and spatio-temporal databases."-- back cover. (shrink)

Product acceptance determination using similarity measure index by neutrosophic statistics / Muhammad Aslam and Rehan Ahmed Khan Sherwani -- New concepts of strongly edge irregular interval-valued neutrosophic graphs / A.A.Talebi, Hossein Rashmanlou and Masoomeh Ghasemi -- The link between neutrosophy and learning : through the related concepts of representation and compression / Philippe Schweizer -- Neutrosophic soft cubic M-subalgebras of B-algebras / Mohsin Khalid, Neha Andaleeb Khalid and Hasan Khalid -- Alpha, beta and gamma product of neutrosophic graphs / Nasir (...) Shah, Said Broumi, Abdul Raheem and Tahir Imran -- Neutrosophic cubic normal ideal and neutrosophic cubic closed normal ideal of PS-algebra / Mohsin Khalid, Hasan khalid and Neha Andaleeb Khalid -- Neutrosophic multisets : an overview / Vakkas Uluçay -- Neutrosophy as a model for knowledge : the influence of representative models on thinking / Philippe Schweizer -- When neutrosophic theory meets three-way decisions / Rui Ren, Chao Zhang and Deyu Li -- Neutrosophic economic order quantity model with more than one price breaks / R. Surya, M. Mullai and G. Madhan Kumar -- General non-square systems of linear equations in single-valued triangular neutrosophic number environment / S.A. Edalatpanah -- Hesitant neutrosophic soft set relations / Abhijit Saha -- Computer application of neutrosophic set operations / S. Saranya, M. Vigneshwaran, Said Broumi -- Triangular bipolar neutrosophic based transportation problem / Avishek Chakraborty -- Studying neutrosophic variables / Rafif Alhabib and Ahmad Salama -- Decision making for logistics center location selection in trapezoidal neutrosophic environment / Kalyan Mondal and Surapati Pramanik -- Weighted similarity measure and decision making model for clinical application of single valued neutrosophic set / R.Binu and P. Isaac -- Rough neutrosophic set : an overview / Surapati Pramanik -- Some new concepts on normalized SVTN-number and multiple criteria decision making / İrfan Deli and Emel Kırmızı Öztürk. (shrink)

In this paper we prove general exact unprovability results that show how a threshold between provability and unprovability of a finite well-quasi-orderedness assertion of a combinatorial class is transformed by the sequence-construction, multiset-construction, cycle-construction and labeled-tree-construction. Provability proofs use the asymptotic pigeonhole principle, unprovability proofs use Weiermann-style compression techniques and results from analytic combinatorics.

This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call order-deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under pomset prefix (hence prefix closed sets of order-deterministic pomsets are prime algebraic), and it constitutes a reflective subcategory of the category of all pomsets. For the order-deterministic pomsets we develop an algebra with a sound and (-) (...) complete equational theory. The operators in the algebra are concatenation and join, the latter being a variation on the more usual disjoint union of pomsets. This theory is then extended in order to capture refinement of pomsets by incorporating homomorphisms between models as objects in the algebra and homomorphism application as a new operator. (shrink)

We generalize the notion ofconsequence relationstandard in abstract treatments of logic to accommodate intuitions ofrelevance. The guiding idea follows theuse criterion, according to which in order for some premises to have some conclusion(s) as consequence(s), the premises must each beusedin some way to obtain the conclusion(s). This relevance intuition turns out to require not just a failure of monotonicity, but also a move to considering consequence relations as obtaining betweenmultisets. We motivate and state basic definitions of relevant consequence relations, both (...) in single conclusion (asymmetric) and multiple conclusion (symmetric) settings, as well as derivations and theories, guided by the use intuitions, and prove a number of results indicating that the definitions capture the desired results (at least in many cases). (shrink)

Combining information from two or possibly several blocks of data is gaining increased attention and importance in several areas of science and industry. Typical examples can be found in chemistry, spectroscopy, metabolomics, genomics, systems biology and sensory science. Many methods and procedures have been proposed and used in practice. The area goes under different names: data integration, data fusion, multiblock analyses, multiset analyses and a few more. This book is an attempt to give an up-to-date treatment of the most used (...) and important methods within an important branch of the area; namely methods based on so-called components or latent variables. These methods have already obtained an enormous attention in for instance chemometrics, bioinformatics, machine learning and sensometrics and have proved to be important both for prediction and interpretation. The book is primarily a description of methodologies, but most of the methods will be illustrated by examples from the above-mentioned areas. The book is written such that both users of the methods as well as method developers will hopefully find sections of interest. In the end of the book there is a description of a software package developed particularly for the book. This package is freely available in R and covers many of the methods discussed. To distinguish the different type of methods from each other, the book is divided into five parts. Part I is introduction and preliminary concepts. Part II is the core of the book containing the main unsupervised and supervised methods. Part III deals with more complex structures and, finally, Part IV discusses alternative unsupervised and supervised methods. The book ends with Part V discussing the available software. Our recommendation for reading the book are as follows. A minimum read of the book would involve chapters 1, 2, 3, 5 and 7. Chapters 4, 6 and 8 are more specialized and chapters 9 and 10 contain methods we think are more advanced or less obvious to use. We feel privileged to have so many friendly colleagues who were willing to spend their time on helping us to improve the book by reading separate chapters. We would like to express our thanks to: Rasmus Bro, Margriet Hendriks, Ulf Indahl, Henk Kiers, Ingrid MaÌ⁽ge, Federico Marini, AÌ⁽smund Rinnan, Rosaria Romano, Lars Erik Solberg, Marieke Timmerman, Oliver Tomic, Johan Westerhuis and Barry Wise. Of course, the correctness of the final text is fully our responsibility! (shrink)

A prized property of theories of all kinds is that of generality, of applicability or least relevance to a wide range of circumstances and situations. The purpose of this article is to present a pair of distinctions that suggest that three kinds of generality are to be found in mathematics and logics, not only at some particular period but especially in developments that take place over time: ‘omnipresent’ and ‘multipresent’ theories, and ‘ubiquitous’ notions that form dependent parts, or moments, of (...) theories. The category of ‘facets’ is also introduced, primarily to assess the roles of diagrams and notations in these two disciplines. Various consequences are explored, starting with means of developing applied mathematics, and then reconsidering several established ways of elaborating or appraising theories, such as analogising, revolutions, abstraction, unification, reduction and axiomatisation. The influence of theories already in place upon theory-building is emphasised. The roles in both mathematics and logics of set theory, abstract algebras, metamathematics, and model theory are assessed, along with the different relationships between the two disciplines adopted in algebraic logic and in mathematical logic. Finally, the issue of monism versus pluralism in these two disciplines is rehearsed, and some suggestions are made about the special character of mathematical and logical knowledge, and also the differences between them. Since the article is basically an exercise in historiography, historical examples and case studies are described or noted throughout. (shrink)