Horn sentences in identity theory

1959 ◽  
Vol 24 (4) ◽  
pp. 306-310 ◽  
Author(s):  
K. I. Appel

Horn [2] obtained a sufficient condition for an elementary class to be closed under direct product. Chang and Morel [1] showed that this is not a necessary condition. We will show that, if consideration is restricted to identity theory, that is, a first-order predicate calculus with equality but no other relation symbols or operation symbols, Horn's condition is necessary and sufficient.A model for identity theory consists of a non-empty domain A, but no relations or operations except equality. If I is an index set, and for each is a model for identity theory, then the direct product of the is a model for identity theory and has domain A, the cartesian product of the Ai.

1960 ◽  
Vol 25 (1) ◽  
pp. 1-26 ◽  
Author(s):  
H. Jerome Keisler

IntroductionWe shall prove the following theorem, which gives a necessary and sufficient condition for an elementary class to be characterized by a set of sentences having a prescribed number of alternations of quantifiers. A finite sequence of relational systems is said to be a sandwich of order n if each is an elementary extension of (i ≦ n—2), and each is an extension of (i ≦ n—2). If K is an elementary class, then the statements (i) and (ii) are equivalent for each fixed natural number n.


2007 ◽  
Vol 7 (7) ◽  
pp. 624-638
Author(s):  
J. de Vicente

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which we derive a necessary condition and sufficient conditions for separability. For a certain class of states the necessary condition and a sufficient condition turn out to be equivalent, therefore yielding a necessary and sufficient condition. The proofs of the sufficient conditions are constructive, thus providing decompositions in pure product states for the states that satisfy them. We provide examples that show the ability of these conditions to detect entanglement. In particular, the necessary condition is proved to be strong enough to detect bound entangled states.


Author(s):  
Lu Wudu

AbstractConsider the nonlinear neutral equationwhere pi(t), hi(t), gj(t), Q(t) Є C[t0, ∞), limt→∞hi(t) = ∞, limt→∞gj(t) = ∞ i Є Im = {1, 2, …, m}, j Є In = {1, 2, …, n}. We obtain a necessary and sufficient condition (2) for this equation to have a nonoscillatory solution x(t) with limt→∞ inf|x(t)| > 0 (Theorems 5 and 6) or to have a bounded nonoscillatory solution x(t) with limt→∞ inf|x(t)| > 0 (Theorem 7).


2013 ◽  
Vol 14 (3) ◽  
pp. 227
Author(s):  
Mohammad Imam Utoyo ◽  
Basuki Widodo ◽  
Toto Nusantara ◽  
Suhariningsih Suhariningsih

This script was aimed to determine the necessary conditions for boundedness of Riesz potential in the classical Morrey space. If these results are combined with previous research results will be obtained the necessary and sufficient condition for boundedness of Riesz potential. This necessary condition is obtained through the use of characteristic function as one member of the classical Morrey space.


2021 ◽  
Vol 2 (2) ◽  
pp. 30-37
Author(s):  
Alaa A. Abdallah ◽  
A. A. Navlekar ◽  
Kirtiwant P. Ghadle

In this paper, we study the relationship between Cartan's second curvature tensor $P_{jkh}^{i}$ and $(h) hv-$torsion tensor $C_{jk}^{i}$ in sense of Berwald. Moreover, we discuss the necessary and sufficient condition for some tensors which satisfy a recurrence property in $BC$-$RF_{n}$, $P2$-Like-$BC$-$RF_{n}$, $P^{\ast }$-$BC$-$RF_{n}$ and $P$-reducible-$BC-RF_{n}$.


2012 ◽  
Vol 22 (06) ◽  
pp. 1250052 ◽  
Author(s):  
ALI AKHAVI ◽  
INES KLIMANN ◽  
SYLVAIN LOMBARDY ◽  
JEAN MAIRESSE ◽  
MATTHIEU PICANTIN

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskiĭ, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for finiteness and, for groups, an effective necessary but not sufficient condition. The efficiency of the new criteria is demonstrated by testing all Mealy automata with small stateset and alphabet. Finally, for groups, we provide a necessary and sufficient condition that does not directly lead to a decision procedure.


2019 ◽  
Vol 33 (10) ◽  
pp. 1950086
Author(s):  
Qi Wang ◽  
Yinhe Wang ◽  
Zilin Gao ◽  
Lili Zhang ◽  
Wenli Wang

This paper investigates the clustering problem for the generalized signed networks. By rigorous derivations, a sufficient and necessary condition for clustering of the nodes in generalized signed networks is proposed in this paper. In order to obtain this condition, the concept of friends group is first introduced for the nodes based on their links’ sign. Then, the unprivileged network is also defined in this paper by employing the concepts of structural hole and broker. Compared with the existing clustering algorithms, the outstanding advantage in this paper is that only the positive or negative (especially, or zero) sign of the links is required regardless of their density or sparsity. We have proved mathematically that a generalized signed network is classifiable if and only if it is an unprivileged network. Finally, two examples associated with numerical simulations are proposed to generate the unprivileged networks.


2008 ◽  
Vol 24 (3) ◽  
pp. 823-828 ◽  
Author(s):  
Henghsiu Tsai ◽  
Kung-Sik Chan

We consider the parameter restrictions that need to be imposed to ensure that the conditional variance process of a GARCH(p,q) model remains nonnegative. Previously, Nelson and Cao (1992, Journal of Business ’ Economic Statistics 10, 229–235) provided a set of necessary and sufficient conditions for the aforementioned nonnegativity property for GARCH(p,q) models with p ≤ 2 and derived a sufficient condition for the general case of GARCH(p,q) models with p ≥ 3. In this paper, we show that the sufficient condition of Nelson and Cao (1992) for p ≥ 3 actually is also a necessary condition. In addition, we point out the linkage between the absolute monotonicity of the generalized autoregressive conditional heteroskedastic (GARCH) generating function and the nonnegativity of the GARCH kernel, and we use it to provide examples of sufficient conditions for this nonnegativity property to hold.


Sign in / Sign up

Export Citation Format

Share Document