We report on progress and an unsolved problem in our attempt to obtain a clear rationale for relevance logic via semantic decomposition trees. Suitable decomposition rules, constrained by a natural parity condition, generate a set of directly acceptable formulae that contains all axioms of the well-known system R, is closed under substitution and conjunction, satisfies the letter-sharing condition, but is not closed under detachment. To extend it, a natural recursion is built into the procedure for constructing decomposition (...) trees. The resulting set of acceptable formulae has many attractive features, but it remains an open question whether it continues to satisfy the crucial letter-sharing condition. (shrink)

The Feferman–Vaught theorem provides a way of evaluating a first order sentence \(\varphi \) on a disjoint union of structures by producing a decomposition of \(\varphi \) into sentences which can be evaluated on the individual structures and the results of these evaluations combined using a propositional formula. This decomposition can in general be non-elementarily larger than \(\varphi \). We introduce a “tree” generalization of the prenex normal form (PNF) for first order sentences, and show that for (...) an input sentence in this form having a fixed number of quantifier alternations, a Feferman–Vaught decomposition can be obtained in time elementary in the size of the sentence. The sentences in the decomposition are also in tree PNF, and further have the same number of quantifier alternations and the same quantifier rank as the input sentence. We extend this result by considering binary operations other than disjoint union, in particular sum-like operations such as join, ordered sum and NLC-sum, that are definable using quantifier-free translation schemes. (shrink)

Let R be a real closed field, and X⊆Rm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\subseteq R^m}$$\end{document} semi-algebraic and 1-dimensional. We consider complete first-order theories of modules over the ring of continuous semi-algebraic functions X→R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\to R}$$\end{document} definable with parameters in R. As a tool we introduce -piecewise vector bundles on X and show that the category of piecewise vector bundles on X is equivalent to the category of syzygies of (...) finitely generated submodules of free modules. We give an explicit method to determine the Baur–Monk invariants of free modules in terms of pre-piecewise vector bundles. When R is a recursive real closed field this yields the decidability of the theory of free modules. Where it makes sense, we address the same questions for continuous definable functions in o-minimal expansions of a real closed field. From the free module case we are able to deduce generalisations of some results to arbitrary modules over the ring. We present a geometrically motivated quantifier elimination result down to the level of positive primitive formulae with a certain block decomposition of the matrix of coefficients. (shrink)

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents generated by $n$ conditional (...) events and we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula, which can be interpreted by introducing a suitable distributive property. Moreover, under logical independence of basic unconditional events, we give two necessary and sufficient coherence conditions. The first condition gives a geometrical characterization for the coherence of prevision assessments on a family F constituted by n conditional events and all possible conjunctions among them. The second condition characterizes the coherence of prevision assessments defined on $F\cup K$, where $K$ is the set of conditional constituents associated with the conditional events in $F$. Then, we give some further theoretical results and we examine some examples and counterexamples. Finally, we make a comparison with other approaches and we illustrate some theoretical aspects and applications. (shrink)

We give examples of (i) a simple theory with a formula (with parameters) which does not fork over [Formula: see text] but has [Formula: see text]-measure 0 for every automorphism invariant Keisler measure [Formula: see text] and (ii) a definable group [Formula: see text] in a simple theory such that [Formula: see text] is not definably amenable, i.e. there is no translation invariant Keisler measure on [Formula: see text]. We also discuss paradoxical decompositions (...) both in the setting of discrete groups and of definable groups, and prove some positive results about small theories, including the definable amenability of definable groups. (shrink)

We generalize the [Formula: see text] dichotomy to doubly-indexed sequences of analytic digraphs. Under a mild definability assumption, we use this generalization to characterize the family of Borel actions of tsi Polish groups on Polish spaces that can be decomposed into countably-many Borel actions admitting complete Borel sets that are lacunary with respect to an open neighborhood of the identity. We also show that if the group in question is non-archimedean, then the inexistence of such a decomposition yields (...) a special kind of continuous embedding of [Formula: see text] into the corresponding orbit equivalence relation. (shrink)

Our goal is to articulate a clear rationale for relevance-sensitive propositional logic. The method: truth-trees. Familiar decomposition rules for truth-functional connectives, accompanied by novel ones for the for the arrow, together with a recursive rule, generate a set of ‘acceptable’ formulae that properly contains all theorems of the well-known system R and is closed under substitution, conjunction, and detachment. We conjecture that it satisfies the crucial letter-sharing condition.

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure M is cellular if and only if M is \-categorical and mutually algebraic. Second, if a countable structure M in a finite relational language is mutually algebraic non-cellular, we show it admits an elementary extension adding infinitely many infinite MA-connected components. Towards these results, we introduce MA-presentations of a mutually algebraic structure, in which every atomic formula is (...) mutually algebraic. This allows for an improved quantifier elimination and a decomposition of the structure into independent pieces. We also show this decomposition is largely independent of the MA-presentation chosen. (shrink)

Non-deterministic matrices are multiple-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set of options. We consider two different types of semantics which are based on Nmatrices: the dynamic one and the static one . We use the Rasiowa-Sikorski decomposition methodology to get sound and complete proof systems employing finite sets of mv-signed formulas for all propositional logics based on such structures with either of (...) the above types of semantics. Later we demonstrate how these systems can be converted into cut-free ordinary Gentzen calculi which are also sound and complete for the corresponding non-deterministic semantics. As a by-product, we get new semantic characterizations for some well-known logics. (shrink)

The main results in the paper are the following. Theorem A. Suppose that T is superstable and M ⊂ N are distinct models of T eq . Then there is a c ϵ N⧹M such that t is regular. For M ⊂ N two models we say that M ⊂ na N if for all a ϵ M and θ such that θ ≠ θ , there is a b ∈ θ ⧹ acl . Theorem B Suppose that T is (...) superstable , M ⊂ na N are models of T eq , and p is a regular type non-orthogonal to t . Then there is a c ϵ N such that t is regular and non-orthogonal to p. Furthermore, there is a formula θ ∈ t such that a ∈ θ and t ⊥ ̷ p ⇒ t is regular. We used these results to obtain ‘good’ tree decompositions of models in superstable theories with NDOP. See Definition 5.1 for the undefined terms. Theorem C Suppose that T is superstable with NDOP and M ⊨ T eq . Then every ⊂ na - decomposition inside M extends to a ⊂ na -decomposition of M. Furthermore, if 〈N η , a η : η ∈ I〉 is any ⊂ na -decomposition of M, then M is minimal over ∪N η and for all η ∈ I. M is dominated by ∪N η over N η . Using some stable group theory we show that when Th is superstable with NDOP and 〈 N η : η ∈ I 〉 is a tree decomposition of M, then M is constructible over ∪ n η with respect to a very strong isolation relation. (shrink)

The characteristic sequence of hypergraphs Pn:n<ω associated to a formula φ, introduced in Malliaris [5], is defined by Pn=i≤nφ. We continue the study of characteristic sequences, showing that graph-theoretic techniques, notably Szemerédi’s celebrated regularity lemma, can be naturally applied to the study of model-theoretic complexity via the characteristic sequence. Specifically, we relate classification-theoretic properties of φ and of the Pn to density between components in Szemerédi-regular decompositions of graphs in the characteristic sequence. In addition, we use Szemerédi regularity to (...) calibrate model-theoretic notions of independence by describing the depth of independence of a constellation of sets and showing that certain failures of depth imply Shelah’s strong order property SOP3; this sheds light on the interplay of independence and order in unstable theories. (shrink)

Matrix population models provide a natural tool to analyse state-dependent life-history strategies. Reproductive value and the intrinsic rate of natural increase under a strategy, and the optimal life-history strategy can all be easily characterised using projection matrices. The resultant formulae, however, are not directly comparable with the corresponding formulae for age structured populations such as Lotka's equations and Fisher's formula for reproductive value. This is because formulae involving projection matrices lose track of what happens to an individual over its (...) lifetime and are only concerned with expected numbers of descendants one time step in the future. In contrast the usual age-dependent formulae explicitly followed a single individual through from birth to death.In this paper I show how the state-dependent formulae can be rewritten to be directly comparable with the standard age-structured formulae. Although the formulae are intuitively obvious the decomposition into current and future reproductive success differs from that previously given and is, I suggest, a more natural definition. The derivation of appropriate equations for optimal life-histories relies on results from dynamic programming theory; and is much more general and easier than previous derivations. (shrink)

One cannot be responsible for a generic truth, argues Badiou in his critical rejoinder to Sartre; one can only be its militant. Challenging Badiou’s formulation, I propose that his plea for a new stage of the communist hypothesis, which unfolds in the wake of subjective decomposition of the Left, must draw upon the Sartrean notion of collective responsibility to affirm interminable inscription of the egalitarian axiom in a novel political sequence without forcing a violent realisation of equality. Encapsulated in (...) an enigmatic formula, ‘one and one make one,’ Sartrean ethics of the Same compel the Badiouian militant subject to heed the excluded demands of the new proletariat insofar as the latter occupies ‘a point of exile where it is possible that something, finally, might happen.’. (shrink)

We construct free algebras in the variety generated by the equivalential algebra with conjunction on dense elements and compute the formula for the free spectrum of this variety. Moreover, we describe the decomposition of free algebras into directly indecomposable factors.

In the article the author analyzes the phenomenon of ideological work from the socio-philosophical point of view and conducts general conceptualization of ideological work process in the Armed Forces of Ukraine. The author proposes his own variant of definition of object, functions, the main tasks of ideological work in the Ukrainian army. The main goal of ideological work in the Armed Forces of Ukraine is to achieve and maintain high morale of the Armed Forces personnel, to train in military servicemen (...) the sense of personal responsibility for protection of Motherland, to understand the principles of state policy and measures taken in the interest of ensuring national and international security. The above goal is achieved through realization of the objective function, which lies in the ideological motivation of military servicemen towards conscientious performance of military duty and defense of the homeland, implemented under the formula "knowledge - attitude - motivation." After decomposition of the objective function of ideological work in the Armed Forces of Ukraine, the author has singled out a number of working functions - genetic, epistemological, logical, methodological, methodical, informational, propagandistic, agitational, worldview, regulatory, mobilizational, educational, counter propagandistic, protective, cultural educational, spiritually educational, evaluative ones. The author has defined situations in which genetic function of ideological work in the Armed Forces can be noticeably manifested: the formation of a qualitatively new principles of state construction in the context of social transformation; formation of a qualitatively new principles of military construction and military-political course of the state in the context of military and political changes in the international arena, as well as in the middle of military- political alliances; in the period of preparation for the war, during the direct military operations, in the postwar period with the aim of establishing of "victory image" and "victorious war image " in the media and in the public consciousness. (shrink)

The paper presents a compositional approach to the verification of CTL* properties over reactive systems. Both symbolic model-checking and deductive verification are considered. Both methods are based on two decomposition principles. A general state formula is decomposed into basic state formulas which are CTL* formulas with no embedded path quantifiers. To deal with arbitrary basic state formulas, we introduce another reduction principle which replaces each basic path formula, i.e., path formulas whose principal operator is temporal and which (...) contain no embedded temporal operators or path quantifiers, by a newly introduced boolean variable which is added to the system. Thus, both the algorithmic and the deductive methods are based on two statification transformations which successively replace temporal formulas by assertions which contain no path quantifiers or temporal operators. Performing these decompositions repeatedly, we remain with basic assertional formulas, i.e., formulas of the form Efp and Afp for some assertion p. In the model-checking method we present a single symbolic algorithm to verify both universal and existential basic assertional properties. In the deductive method we present a small set of proof rules and show that this set is sound and relatively complete for verifying universal and existential basic assertional properties over reactive systems. Together with two proof rules for the decompositions, we obtain a sound and relatively complete proof system for arbitrary CTL* properties. Interestingly, the deductive approach for CTL* presented here, offers a viable new approach to the deductive verification of arbitrary LTL formulas. The paper corrects a previous preliminary version of a deductive system for CTL*, in which some of the rules were unsound. The correction is based on the introduction of a new type of temporal testers which are guaranteed to be non blocking. That is, when composed with a deadlock-free system, which is a key operation in the verification process, the resulting composed system is guaranteed to remain deadlock free. (shrink)

Counting models for a two conjunctive formula $F$, a problem known as $\sharp $2Sat, is a classic $\sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $\sharp $2Sat can be computed efficiently. In this paper, we address the case when $G$ has cycles. When $G$ is cyclic, we propose a decomposition on the constraint graph $G$ that allows the computation of $\sharp $2Sat in incremental way. Let (...) $T$ be a cactus graph of $G$ containing a maximal number of independent cycles, and let $\overline{T}=-E)$ be a subset of frond edges from $G$. The clauses in $\overline{T}$ are ordered in connected components $\{K_1, \ldots, K_r\}$. Each $, i=1,\ldots,r$ is a knot of the graph. The arrangement of the clauses of $\overline{T}$ allows the decomposition of $G$ in knots and provides a way of computing $\sharp $2Sat in an incremental way. Our procedure has a bottom-up orientation for the computation of $\sharp $2Sat. It begins with $F_0 = T$. In each iteration of the procedure, a new clause $C_i \in \overline{T}$ is considered in order to form $F_i = $ and then to compute $\sharp $2Sat$$ based on the computation of $\sharp $2Sat$$. (shrink)

We show that under the proper forcing axiom the class of all Aronszajn lines behave like [Formula: see text]-scattered orders under the embeddability relation. In particular, we are able to show that the class of better-quasi-order labeled fragmented Aronszajn lines is itself a better-quasi-order. Moreover, we show that every better-quasi-order labeled Aronszajn line can be expressed as a finite sum of labeled types which are algebraically indecomposable. By encoding lines with finite labeled trees, we are also able to deduce (...) a decomposition result, that for every Aronszajn line [Formula: see text] there is an integer [Formula: see text] such that for any finite coloring of [Formula: see text] there is subset [Formula: see text] of [Formula: see text] isomorphic to [Formula: see text] which uses no more than [Formula: see text] colors. (shrink)

Recently, Cluckers et al. developed a new axiomatic framework for tame non-Archimedean geometry, called Hensel minimality. It was extended to mixed characteristic together with the author. Hensel minimality aims to mimic o-minimality in both strong consequences and wide applicability. In this paper, we continue the study of Hensel minimality, in particular focusing on [Formula: see text]-h-minimality and [Formula: see text]-h-minimality, for [Formula: see text] a positive integer. Our main results include an analytic criterion for [Formula: see (...) text]-h-minimality, preservation of [Formula: see text]-h-minimality under coarsening of the valuation and [Formula: see text]-dimensional geometry. (shrink)

The classical limit of real Dirac theory is derived as the lowest-order contribution in $\mathchar'26\mkern-10mu\lambda = \hslash /mc$ of a new, exact polar decomposition. The resulting classical spinor equation is completely integrated for stationary solutions to arbitrary central fields. Imposing single-valuedness on the covering space of a bivector-valued extension to these classical solutions, orbital angular momentum, energy, and spin directions are quantized. The quantization of energy turns out to yield the WKB formula of Bessey, Uhlenbeck, and Good. It (...) is demonstrated that the success of Sommerfeld's old quantization is due to a complete mutual cancellation between wave mechanical half-integers and spin in the particular case of the relativistic Kepler problem. (shrink)

In [12], P. Scowcroft and L. van den Dries proved a cell decomposition theorem for p-adically closed fields. We work here with the notion of P-minimal fields defined by D. Haskell and D. Macpherson in [6]. We prove that a P-minimal field K admits cell decomposition if and only if K has definable selection. A preprint version in French of this result appeared as a prepublication [8].

This paper defends an interpretation of Gottlob Frege’s views on the structure of thought. I argue that Frege did not think that a thought has a unique decomposition into its component senses, but rather the same thought can be decomposed into senses in multiple, distinct ways. These multiple decompositions will often have distinct logical forms. I also argue against Michael Dummett and others that Frege was committed to the sense of a predicate being a function from the sense of (...) a name (or names) to a complete thought. I defend my Frege interpretation against a puzzle often discussed in the Frege literature; namely, that the Multiple Decompositions Thesis is incompatible with Frege’s stated view that a thought is built up out of its component senses as parts. I provide textual evidence and argument that Frege thought of the part/whole relation in such a way that a whole can be analyzed into (or built up out of) parts in multiple, distinct ways, thus dissolving the puzzle. I conclude with discussion of every sort of example of multiple decompositions that can be found in Frege's work. (shrink)

An analysis of two heuristic strategies for the development of mechanistic models, illustrated with historical examples from the life sciences. In Discovering Complexity, William Bechtel and Robert Richardson examine two heuristics that guided the development of mechanistic models in the life sciences: decomposition and localization. Drawing on historical cases from disciplines including cell biology, cognitive neuroscience, and genetics, they identify a number of "choice points" that life scientists confront in developing mechanistic explanations and show how different choices result in (...) divergent explanatory models. Describing decomposition as the attempt to differentiate functional and structural components of a system and localization as the assignment of responsibility for specific functions to specific structures, Bechtel and Richardson examine the usefulness of these heuristics as well as their fallibility—the sometimes false assumption underlying them that nature is significantly decomposable and hierarchically organized. When Discovering Complexity was originally published in 1993, few philosophers of science perceived the centrality of seeking mechanisms to explain phenomena in biology, relying instead on the model of nomological explanation advanced by the logical positivists (a model Bechtel and Richardson found to be utterly inapplicable to the examples from the life sciences in their study). Since then, mechanism and mechanistic explanation have become widely discussed. In a substantive new introduction to this MIT Press edition of their book, Bechtel and Richardson examine both philosophical and scientific developments in research on mechanistic models since 1993. (shrink)

I argue, through appeal to the distinction between analysis and decomposition described by Dummett, that Wittgenstein employs both of those notions in the Tractatus. I then bring this interpretation to bear upon the issue of propositional unity, where I formulate an objection to the views of both Leonard Linksy and José Zalabardo. I show that both Linsky and Zalabardo fail to acknowledge the distinction between analysis and decomposition present in the Tractatus, and that they consequently mischaracterise Wittgenstein’s position (...) with respect to propositional unity. (shrink)

In this paper we develop a differential analogue of o-minimal cell decomposition for the theory CODF of closed ordered differential fields. Thanks to this differential cell decomposition we define a well-behaving dimension function on the class of definable sets in CODF. We conclude this paper by proving that this dimension is closely related to both the usual differential transcendence degree and the topological dimension associated, in this case, with a natural differential topology on ordered differential fields.

C-minimality is a variant of o-minimality in which structures carry, instead of a linear ordering, a ternary relation interpretable in a natural way on set of maximal chains of a tree. This notion is discussed, a cell-decomposition theorem for C-minimal structures is proved, and a notion of dimension is introduced. It is shown that C-minimal fields are precisely valued algebraically closed fields. It is also shown that, if certain specific ‘bad’ functions are not definable, then algebraic closure has the (...) exchange property, and for definable sets dimension coincides with the rank obtained from algebraic closure. (shrink)

We prove that forp-optimal fields a cell decomposition theorem follows from methods going back to Denef’s paper [7]. We derive from it the existence of definable Skolem functions and strongp-minimality. Then we turn to stronglyp-minimal fields satisfying the Extreme Value Property—a property which in particular holds in fields which are elementarily equivalent to ap-adic one. For such fieldsK, we prove that every definable subset ofK×Kdwhose fibers overKare inverse images by the valuation of subsets of the value group is semialgebraic. (...) Combining the two we get a preparation theorem for definable functions onp-optimal fields satisfying the Extreme Value Property, from which it follows that infinite sets definable over such fields are in definable bijection iff they have the same dimension. (shrink)

I attempt to complement my earlier critiques of human sociobiology, by offering an account of how evolutionary ideas might legitimately be employed in the study of human social behavior. The main emphasis of the paper is the need to integrate studies of proximate mechanisms and their ontogenesis with functional/evolutionary research. Human psychological complexity makes it impossible to focus simply on specific types of human behavior and ask for their functional significance. For any of the kinds of behavior patterns that have (...) occupied human sociobiologists, the underlying proximate mechanisms are very likely to be linked to a broad spectrum of types of behavior, and we cannot expect that natural selection will have acted directly on any individual element from this spectrum. I illustrate this general point with a specific example, considering the traditional sociobiological account of human incest-avoidance and outlining an alternative approach to the phenomena. The example is intended to show the possibility of a more rigorous and sophisticated successor to human sociobiology, which I call "human behavioral ecology". (shrink)

Recently, decomposition-based multiobjective evolutionary algorithms have good performances in the field of multiobjective optimization problems and have been paid attention by many scholars. Generally, a MOP is decomposed into a number of subproblems through a set of weight vectors with good uniformly and aggregate functions. The main role of weight vectors is to ensure the diversity and convergence of obtained solutions. However, these algorithms with uniformity of weight vectors cannot obtain a set of solutions with good diversity on some (...) MOPs with complex Pareto optimal fronts. To deal with this problem, an improved decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment is proposed. Firstly, a new method based on uniform design and crowding distance is used to generate a set of weight vectors with good uniformly. Secondly, according to the distances of obtained nondominated solutions, an adaptive weight vector adjustment strategy is proposed to redistribute the weight vectors of subobjective spaces. Thirdly, a selection strategy is used to help each subobjective space to obtain a nondominated solution. Comparing with six efficient state-of-the-art algorithms, for example, NSGAII, MOEA/D, MOEA/D-AWA, EMOSA, RVEA, and KnEA on some benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. (shrink)

Functional decomposition is an important goal in the life sciences, and is central to mechanistic explanation and explanatory reduction. A growing literature in philosophy of science, however, has challenged decomposition-based notions of explanation. ‘Holists’ posit that complex systems exhibit context-sensitivity, dynamic interaction, and network dependence, and that these properties undermine decomposition. They then infer from the failure of decomposition to the failure of mechanistic explanation and reduction. I argue that complexity, so construed, is only incompatible with (...) one notion of decomposition, which I call ‘atomism’, and not with decomposition writ large. Atomism posits that function ascriptions must be made to parts with minimal reference to the surrounding system. Complexity does indeed falsify atomism, but I contend that there is a weaker, ‘contextualist’ notion of decomposition that is fully compatible with the properties that holists cite. Contextualism suggests that the function of parts can shift with external context, and that interactions with other parts might help determine their context-appropriate functions. This still admits of functional decomposition within a given context. I will give examples based on the notion of oscillatory multiplexing in systems neuroscience. If contextualism is feasible, then holist inferences are faulty—one cannot infer from the presence of complexity to the failure of decomposition, mechanism, and reductionism. (shrink)

We develop a notion of cell decomposition suitable for studying weak p-adic structures definable). As an example, we consider a structure with restricted addition.

We study a reduct ${\mathcal{L}_*}$ of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the ${\mathcal{L}_*}$ -definable subsets of K coincide with the semi-algebraic subsets of K. Hence structures (K, ${\mathcal{L}_*}$ ) can be seen as the p-adic counterpart of the o-minimal structure of semibounded sets. We show that in this language, p-adically closed fields admit cell decomposition, using cells similar to p-adic semi-algebraic cells. (...) From this we can derive quantifier-elimination, and give a characterization of definable functions. In particular, we conclude that multiplication can only be defined on bounded sets, and we consider the existence of definable Skolem functions. (shrink)

A synaptic algebra is a generalization of the self-adjoint part of a von Neumann algebra. In this article we extend to synaptic algebras the type-I/II/III decomposition of von Neumann algebras, AW∗-algebras, and JW-algebras.

Decompositional equivalence is the principle that there is no preferred decomposition of the universe into subsystems. It is shown here, by using a simple thought experiment, that quantum theory follows from decompositional equivalence together with Landauer’s principle. This demonstration raises within physics a question previously left to psychology: how do human—or any—observers identify or agree about what constitutes a “system of interest”?

Mediation analysis has been used in many disciplines to explain the mechanism or process that underlies an observed relationship between an exposure variable and an outcome variable via the inclusion of mediators. Decompositions of the total effect of an exposure variable into effects characterizing mediation pathways and interactions have gained an increasing amount of interest in the last decade. In this work, we develop decompositions for scenarios where two mediators are causally sequential or non-sequential. Current developments in this area have (...) primarily focused on either decompositions without interaction components or with interactions but assuming no causally sequential order between the mediators. We propose a new concept called natural mediated interaction effect that captures the two-way and three-way interactions for both scenarios and extends the two-way MIs in the literature. We develop a unified approach for decomposing the TE into the effects that are due to mediation only, interaction only, both mediation and interaction, neither mediation nor interaction within the counterfactual framework. Finally, we compare our proposed decomposition to an existing method in a non-sequential two-mediator scenario using simulated data, and illustrate the proposed decomposition for a sequential two-mediator scenario using a real data analysis. (shrink)

Frege seems to hold two incompatible theses:(i) that sentences differing in structure can yet express the same sense; and (ii) that the senses of the meaningful parts of a complex term are determinate parts of the sense of the term. Dummett offered a solution, distinguishing analysis from decomposition. The present paper offers an embellishment of Dummett?s distinction by providing a way of depicting the internal structures of complex senses?determinate structures that yield distinct decompositions. Decomposition is then shown to (...) be adequate as a foundation for the informativity and analyticity of logic. (shrink)

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions. Characterizations are given for pairs of isomorphic formulae, which lead to decision procedures for this isomorphism.

Decomposition is a bracing, revisionary, and provocative inquiry into music—from Beethoven to Duke Ellington, from Conlon Nancarrow to Evelyn Glennie—as a personal and cultural experience: how it is composed, how it is idiosyncratically perceived by critics and reviewers, and why we listen to it the way we do. Andrew Durkin, best known as the leader of the West Coast–based Industrial Jazz Group, is singular for his insistence on asking tough questions about the complexity of our presumptions about music and (...) about listening, especially in the digital age. In this winning and lucid study he explodes the age-old concept of musical composition as the work of individual genius, arguing instead that in both its composition and reception music is fundamentally a collaborative enterprise that comes into being only through mediation. Drawing on a rich variety of examples—Big Jay McNeely’s “Deacon’s Hop,” Biz Markie’s “Alone Again,” George Antheil’s Ballet Mécanique, Frank Zappa’s “While You Were Art,” and Pauline Oliveros’s “Tuning Meditation,” to name only a few—Durkin makes clear that our appreciation of any piece of music is always informed by neuroscientific, psychological, technological, and cultural factors. How we listen to music, he maintains, might have as much power to change it as music might have to change how we listen. (shrink)

This article proposes three new decompositions of inequality measures, drawn from the framework of cooperative game theory. It allows the impact of players’ interactions, rather than players’ contributions to inequality, to be taken into consideration. These innovative approaches are especially suited for the study of income inequality when the income has a hierarchical structure: the income is composed of several primary sources, with the particularity that each of them is also composed of secondary sources. We revisit the Shapley–Owen value that (...) quantifies the importance of each of these secondary sources in the overall income inequality. Our main contribution is to decompose this importance into two parts: the pure marginal contribution of the considered source and a weighted sum of pairwise interactions. We then provide an axiomatic characterization of each additive interaction decomposable (AID) coalitional value considered in this paper. We give an application of these decompositions in the context of inequality theory. (shrink)

Kant is gaining popularity in business ethics because the categorical imperative rules out actions such as deceptive advertising and exploitative working conditions, both of which treat people merely as means to an end. However, those who apply Kant in this way often hold businesses themselves morally accountable, and this conception of collective responsibility contradicts the kind of moral agency that underlies Kant's ethics. A business has neither inclinations nor the capacity to reason, so it lacks the conditions necessary for constraint (...) by the moral law. Instead, corporate policies ought to be understood as analogous to legal constraints. They may encourage or discourage certain actions, but they cannot determine a person's maxim - which for Kant is the focus of moral judgment. Because there is no collective intention apart from any intentions of the individual agents who act as members of the corporation, an organization itself has no moral obligations. This poses a dilemma: either apply the categorical imperative to the actions of particular businesspeople and surrender the notion of collective responsibility, or apply a different moral theory to the actions of businesses themselves. Given the diffusion of responsibility in a bureaucracy, the explanatory usefulness of collective responsibility may force business ethicists to abandon Kant's moral philosophy. (shrink)

This paper presents decomposition of the fourth-order Euler-type linear time-varying system as a commutative pair of two second-order Euler-type systems. All necessary and sufficient conditions for the decomposition are deployed to investigate the commutativity, sensitivity, and the effect of disturbance on the fourth-order LTVS. Some systems are commutative, and some are not commutative, while some are commutative under certain conditions. Based on this fact, the commutativity of fourth-order Euler-type LTVS is investigated by introducing the commutative requirements, theories, and (...) conditions. The fourth-order Euler-type LTVSs are investigated into commutative pairs of twice Euler-type second-order linear time-varying systems. The decomposition theories and conditions are derived, proved, and solved to simplify the use of commutativity for practical and industrial uses. Some fourth-order systems are sensitive toward change in initial conditions or parameters while others are not, and the effect due to disturbance also varies within systems. Furthermore, the stability and robustness of systems have so many issues. But we consider fourth-order Euler-type LTVS to observe, investigate, and tackle these issues. Lastly, the realization of fourth-order LTVS from cascaded two second-order systems can be laboratory experimented which is an open problem for future engineers to investigate. However, the theoretical results show a good agreement with the simulation results is considered in this work. Perhaps it might have unlimited physical applications in science and engineering as well as theoretical contribution. But beyond any reasonable doubt, the novelty is guaranteed because this study is the first of its kind that introduces the decomposition of the fourth-order Euler-type linear time-varying system as a commutative pair of two second-order Euler-type systems. Illustrative examples are presented to support the results. (shrink)

This chapter contains sections titled: Decision‐Making Procedures and Maxims in Corporate Settings The Need for Collective Responsibility in Business Ethics Applying the Categorical Imperative to Businesses Kant's Account of Moral Agency and the Categorical Imperative Must We Never Treat a Business Merely as a Means? Corporate Policies and Individual Agents Bowie's Defense of Collective Responsibility, and the Need for an Alternative Personal Responsibility within the Corporation The Choice Facing Business Ethicists: Kant or Collective Responsibility?

The concept of technical function is a key concept to describe technical artifacts and artifacts-to-be-designed. Engineers often give such descriptions in terms of functional decomposition models, which represent relationships between functions and sets of other functions. Despite the importance of the concept of function there is no consensus among engineers about its meaning. Models of functional decomposition are likewise conceptually divergent. Although this conceptual diversity hampers information exchange between engineers, they accept and maintain it. Engineers do not, by (...) and large, engage in a focused debate to establish commonly shared functional conceptualizations. This contrasts with science where both debates on the adequacy of key conceptualizations and convergence toward shared conceptualizations are common. This book investigates the side-by-side usage of different functional decomposition models in engineering. It explains this phenomenon by applying and extending the analysis of theory choice in terms of methodological incommensurability to engineering functional decomposition, rather than to science. This analysis shows that engineers’ usage of competing functional decomposition models is rational from a practical point of view. This book furthermore investigates the communication problems that the side-by-side usage of different models engenders and presents a strategy that supports the exchange and re-use of functional information between engineers. (shrink)

We describe here a special subdirect decomposition of algebras with modular congruence lattice. Such a decomposition is based on the properties of the congruence lattices of algebras. We consider four properties of lattices: atomic, atomless, locally uniform and anti-uniform. In effect, we describe a star-decomposition of a given algebra with modular congruence lattice into two or three parts associated to these properties.