Search results for " equivalence"
showing 10 items of 68 documents
On the exponential growth of graded Capelli polynomials
2013
In a free superalgebra over a field of characteristic zero we consider the graded Capelli polynomials Cap M+1[Y,X] and Cap L+1[Z,X] alternating on M+1 even variables and L+1 odd variables, respectively. Here we compute the superexponent of the variety of superalgebras determinated by Cap M+1[Y,X] and Cap L+1[Z,X]. An essential tool in our computation is the generalized-six-square theorem proved in [3].
Numerical and Experimental Investigation of Equivalence Ratio (ER) and Feedstock Particle Size on Birchwood Gasification
2017
This paper discusses the characteristics of Birchwood gasification using the simulated results of a Computational Fluid Dynamics (CFD) model. The CFD model is developed and validated with the experimental results obtained with the fixed bed downdraft gasifier available at the University of Agder (UIA), Norway. In this work, several parameters are examined and given importance, such as producer gas yield, syngas composition, lower heating value (LHV), and cold gas efficiency (CGE) of the syngas. The behavior of the parameters mentioned above is examined by varying the biomass particle size. The diameters of the two biomass particles are 11.5 mm and 9.18 mm. All the parameters investigate wit…
Aggregation of Risk Level Assessments Based on Fuzzy Equivalence Relation
2017
The paper deals with the problem of aggregation of risk level assessments. We describe the technique of a risk level evaluation taking into account values of the risk level obtained for objects which are in some sense equivalent. For this purpose we propose to use the construction of a general aggregation operator based on the corresponding fuzzy equivalence relation. Numerical example of the investment risk level aggregation using an equivalence relation obtained on the basis of different macroeconomic factors for countries of one region is considered.
Two-Variable First-Order Logic with Equivalence Closure
2012
We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…
Logics with counting and equivalence
2014
We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.
Butterflies in a Semi-Abelian Context
2011
It is known that monoidal functors between internal groupoids in the category Grp of groups constitute the bicategory of fractions of the 2-category Grpd(Grp) of internal groupoids, internal functors and internal natural transformations in Grp, with respect to weak equivalences (that is, internal functors which are internally fully faithful and essentially surjective on objects). Monoidal functors can be equivalently described by a kind of weak morphisms introduced by B. Noohi under the name of butterflies. In order to internalize monoidal functors in a wide context, we introduce the notion of internal butterflies between internal crossed modules in a semi-abelian category C, and we show th…
A Note on Algebraic Sums of Subsets of the Real Line
2002
AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…
Estudio piloto de la validez convergente de la adaptación española del Denison Organizational Culture Survey
2016
espanolEl (DOCS, Cuestionario de Cultura Organizacional de Denison) es uno de los instrumentos mas utilizados en el analisis de la cultura organizacional. El objetivo de este articulo es analizar la validez convergente de la version en espanol del DOCS. Para ello hemos empleado otro instrumento de gran relevancia y utilizacion en el campo de la psicologia de las organizaciones, el Organizational Culture Inventory (OCI, Inventario de Cultura Organizacional) de Cooke y Lafferty. Hemos evaluado la validez convergente de estos cuestionarios por medio de correlaciones de Pearson, utilizando una muestra de 344 miembros de una universidad espanola pertenecientes a diferentes equipos de investigaci…
Towards a test of the weak equivalence principle of gravity using anti-hydrogen at CERN
2016
International audience; The aim of the GBAR (Gravitational Behavior of Antimatter at Rest) experiment is to measure the free fall acceleration of an antihydrogen atom, in the terrestrial gravitational field at CERN and therefore test the Weak Equivalence Principle with antimatter. The aim is to measure the local gravity with a 1% uncertainty which can be reduced to few parts of 10-3.
Local Normal Forms for First-Order Logic with Applications to Games and Automata
1999
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of distance at most r from y. \par From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. \par As another application, automata mode…