Displaying similar documents to “On a problem of saturation of certain reduced direct products”

Remarks concerning Driver's equation

Gerd Herzog, Roland Lemmert (1994)

Annales Polonici Mathematici

Similarity:

We consider uniqueness for the initial value problem x' = 1 + f(x) - f(t), x(0) = 0. Several uniqueness criteria are given as well as an example of non-uniqueness.

Max-min interval systems of linear equations with bounded solution

Helena Myšková (2012)

Kybernetika

Similarity:

Max-min algebra is an algebraic structure in which classical addition and multiplication are replaced by and , where a b = max { a , b } , a b = min { a , b } . The notation 𝐀 𝐱 = 𝐛 represents an interval system of linear equations, where 𝐀 = [ A ̲ , A ¯ ] , 𝐛 = [ b ̲ , b ¯ ] are given interval matrix and interval vector, respectively, and a solution is from a given interval vector 𝐱 = [ x ̲ , x ¯ ] . We define six types of solvability of max-min interval systems with bounded solution and give necessary and sufficient conditions for them.

On a Theorem of Mierczyński

Gerd Herzog (1998)

Colloquium Mathematicae

Similarity:

We prove that the initial value problem x’(t) = f(t,x(t)), x ( 0 ) = x 1 is uniquely solvable in certain ordered Banach spaces if f is quasimonotone increasing with respect to x and f satisfies a one-sided Lipschitz condition with respect to a certain convex functional.

On a problem of Steve Kalikow

Saharon Shelah (2000)

Fundamenta Mathematicae

Similarity:

The Kalikow problem for a pair (λ,κ) of cardinal numbers,λ > κ (in particular κ = 2) is whether we can map the family of ω-sequences from λ to the family of ω-sequences from κ in a very continuous manner. Namely, we demand that for η,ν ∈ ω we have: η, ν are almost equal if and only if their images are. We show consistency of the negative answer, e.g., for ω but we prove it for smaller cardinals. We indicate a close connection with the free subset property and its variants. ...

Model Checking. Part III

Kazuhisa Ishida, Yasunari Shidama (2008)

Formalized Mathematics

Similarity:

This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for transforming. And then, we defined the Buchi automaton and verified the transforming algorithm.MML...