Robustness of the Algorithm of Identification of the Type of Dynamic Object Found at the Finite Sequence of 2D Background Frames of the Optoelectron Device

2019 ◽  
Vol 40 (12) ◽  
pp. 2062-2076
Author(s):  
A. N. Katulev ◽  
A. N. Sotnikov ◽  
V. K. Kemaykin ◽  
I. V. Kozhukhin
Keyword(s):  
Finite Sequence ◽  
Dynamic Object

Theory of models with generalized atomic formulas

1960 ◽  
Vol 25 (1) ◽  
pp. 1-26 ◽  
Author(s):  
H. Jerome Keisler
Keyword(s):  
Natural Number ◽  
Finite Sequence ◽  
Sufficient Condition ◽  
Elementary Extension ◽  
Necessary And Sufficient Condition ◽  
Elementary Class ◽  
Relational Systems ◽  
Necessary And Sufficient

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.

Sign in / Sign up

Export Citation Format

Share Document