Results 251 to 260 of about 268,883 (290)

Completeness Criterion in Class of Exponential-Polynomial Functions

Moscow University Computational Mathematics and Cybernetics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Transfinite extensions of Friedberg's completeness criterion

Journal of Symbolic Logic, 1977
In [3] Friedberg showed that every Turing degree ≥ 0′ is the jump of some degree. Using the relativized version of this theorem it can be shown by finite induction that if a ≥ 0(n)0(n) then there is a b such that b(n) = a (our notation is defined in §1). It is natural to ask whether these results can be extended into the transfinite.
openaire   +2 more sources

Percussion drilling with laser: hole completion criterion

The International Journal of Advanced Manufacturing Technology, 2006
The criterion for ensuring formation of a through hole is an important aspect of laser drilling. Close observation of the process has indicated that drilling of the substrate is achieved in six successive microstages. The stages have been time resolved and the behaviour of laser induced plasma (LIP) during the microstages of drilling has been carefully
N. D. Pandey, H. S. Shan, A. Bharti
openaire   +1 more source

A Local Flatness Criterion for Complete Modules

Communications in Algebra, 2006
We prove various extensions of the Local Flatness Criterion over a Noetherian local ring R with residue field k. For instance, if Ω is a complete R-module of finite projective dimension, then Ω is flat if and only if for all n = 1,…, depth (R). In low dimensions, we have the following criteria. If R is one-dimensional and reduced, then Ω is flat if and
openaire   +1 more source

A completeness criterion for semi-affine algebras

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic, 2003
A semi-affine algebra is considered complete if it is a simple affine algebra, and the question of under what conditions a semi-affine algebra is complete is investigated. It is determined that a finite algebra A that is semi-affine with respect to an elementary Abelian group is complete if and only if A admits no nontrival congruence of the group and ...
openaire   +1 more source

A criterion for completeness of Casimir operators

Journal of Mathematical Physics, 1981
We give a criterion for a set of Casimir operators of any semisimple Lie algebra to be an algebraically independent generating set of the algebra of the Casimir operators. The criterion is applied to supply complete sets for the Casimir operators of Al, Bl, Cl , and Dl .
openaire   +1 more source

Completing the neo‐Darwinian synthesis with an event criterion

Cladistics, 2007
AbstractWilli Hennig conceptualized the systematic character as an inherited transformation event whereas he operationalized it in terms of the similarity of objects. A causal evolutionary explanation underlies his conceptualization; however, the operational definition is denied that explication because similarity is an abstraction—the similarity of ...
openaire   +2 more sources

Corrigenda: A Completeness Criterion for Spectra

SIAM Journal on Computing, 1979
Hikita, T., Nozaki, A.
openaire   +2 more sources

Criterion for complete determinacy for concave-convexlike games

Mathematical Notes of the Academy of Sciences of the USSR, 1991
Two-person zero-sum continuous games with concave-convex payoffs are considered. A necessary and sufficient condition for the existence of a solution to the game is proved. As a sufficient condition this generalizes a well-known theorem of von Neumann, but as a necessary condition it is new.
openaire   +1 more source

Criterion of the Logical Completeness for Ontologies

The number of ontologies is increasing day by day. Each ontology describes its own subject area, but this does not mean that there is only one ontology for each subject area. On the contrary, due to the decentralization of development centers, there may be several ontologies for the same subject area.
  +4 more sources