Chain models: Applications of consistency properties and back-and-forth techniques in infinite-quantifier languages

1975 ◽  
pp. 125-142 ◽  
Author(s):  
Ellen Cunningham
Keyword(s):  
Consistency Properties

Some model theory for game logics

1979 ◽  
Vol 44 (2) ◽  
pp. 147-152
Author(s):  
Judy Green
Keyword(s):  
Model Theory ◽  
Existence Theorems ◽  
Semantic Interpretation ◽  
Rule Based ◽  
Game Logic ◽  
Important Method ◽  
Consistency Property ◽  
Consistency Properties ◽  
Model Existence

Consistency properties and their model existence theorems have provided an important method of constructing models for fragments of L∞ω. In [E] Ellentuck extended this construction to Suslin logic. One of his extensions, the Borel consistency property, has its extra rule based not on the semantic interpretation of the extra symbols but rather on a theorem of Sierpinski about the classical operation . In this paper we extend that consistency property to the game logic LG and use it to show how one can extend results about and its countable fragments to LG and certain of its countable fragments. The particular formation of LG which we use will allow in the game quantifier infinite alternation of countable conjunctions and disjunctions as well as infinite alternation of quantifiers. In this way LG can be viewed as an extension of Suslin logic.

scholarly journals Usage of Invariants for Symbolic Verification of Requirements

10.29007/2nr2 ◽  
2018 ◽  
Author(s):  
Alexander Letichevsky ◽  
Alexander Godlevsky ◽  
Anton Guba ◽  
Alexander Kolchin ◽  
Oleksandr Letychevskyi ◽  
...  
Keyword(s):  
Iterative Method ◽  
Reactive Systems ◽  
Consistency Properties ◽  
Double Approximation ◽  
Symbolic Verification

The paper presents the usage of invariants for symbolic verification of requirements for reactive systems. It includes checking of safety, incompleteness, liveness, consistency properties, and livelock detection. The paper describes the iterative method of double approximation and the method of undetermined coefficients for invariants generation. Benefits, disadvantages, and comparison of this technique with existing methods are considered. The paper is illustrated by examples of invariants technique usage for symbolic verification.

Consistency properties of chaotic systems driven by time-delayed feedback

2018 ◽  
Vol 97 (4) ◽  
Author(s):  
T. Jüngling ◽  
M. C. Soriano ◽  
N. Oliver ◽  
X. Porte ◽  
I. Fischer
Keyword(s):  
Chaotic Systems ◽  
Delayed Feedback ◽  
Consistency Properties ◽  
Time Delayed Feedback

Estimating tail decay for stationary sequences via extreme values

2004 ◽  
Vol 36 (1) ◽  
pp. 198-226 ◽  
Author(s):  
Assaf Zeevi ◽  
Peter W. Glynn
Keyword(s):  
Convergence Rates ◽  
Marginal Distribution ◽  
Extreme Values ◽  
Moving Average ◽  
Time Interval ◽  
Decay Parameter ◽  
Mixing Conditions ◽  
Stationary Sequences ◽  
Limit Theory ◽  
Consistency Properties

We study estimation of the tail-decay parameter of the marginal distribution corresponding to a discrete-time, real-valued stationary stochastic process. Assuming that the underlying process is short-range dependent, we investigate properties of estimators of the tail-decay parameter which are based on the maximal extreme value of the process observed over a sampled time interval. These estimators only assume that the tail of the marginal distribution is roughly exponential, plus some modest ‘mixing’ conditions. Consistency properties of these estimators are established, as well as minimax convergence rates. We also provide some discussion on estimating the pre-exponent, when a more refined tail asymptotic is assumed. Properties of a certain moving-average variant of the extremal-based estimator are investigated as well. In passing, we also characterize the precise dependence (mixing) assumptions that support almost-sure limit theory for normalized extreme values and related first-passage times in stationary sequences.

Sign in / Sign up

Export Citation Format

Share Document