Results 261 to 270 of about 45,723 (298)

A criterion for completeness of degrees of unsolvability

Journal of Symbolic Logic, 1957
Kleene and Post [2] have shown that between each degree a and its completion a′ there are an infinity of mutually incomparable degrees of unsolvability, and that between a and its nth. completion a(n) there are an infinity of mutually incomparable degrees each incomparable with a′, …, a(n−1).
openaire   +1 more source

A signed measure completeness criterion

Letters in Mathematical Physics, 1989
Let S be a real or a complex inner product space. Let E(S) be the set of all subspaces M of S for which the condition: \(M+M^{\perp}=S\) holds. In this paper the authors show that S is complete iff E(S) possesses at least one nonzero completely additive signed measure on E(S) or, equivalently, iff S possesses at least one nonzero frame function.
Dvurečenskij, Anatolij, Pulmannová, Sylvia   +1 more
openaire   +2 more sources

on stability criterion of complete intersections

Journal of Geometric Analysis, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Regularity Criterion for Complete Matrix Semirings

Mathematical Notes, 2001
Let \((S,+,\cdot)\) be an additively commutative semiring with absorbing zero 0. \(S\) is regular if for every \(a\in S\) the equation \(axa=a\) is solvable in \(S\). It is shown, that for \(n\geq 3\) the semiring \(M_n(S)\) of all \(n\times n\)-matrices over \(S\) is regular iff \(S\) is a regular ring.
openaire   +3 more sources

Risk factors as causes of accidents: Criterion of causality, logical structure of relationship to accidents and completeness of explanations [PDF]

Accident Analysis and Prevention
Rune Elvik, Risk factors as causes of accidents: Criterion of causality, logical structure of relationship to accidents and completeness of explanations, Accident Analysis & Prevention, Volume 197, 2024, 107469, ISSN 0001-4575, https://doi.org/10.1016/j ...
Rune Elvik
exaly   +2 more sources

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

Criterion of Completeness of Sustainable Environmental Management

Geography and Natural Resources
A K Cherkashin
exaly   +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

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

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