On negative escape time in semidynamical systems.
Ciesielski, Krzysztof (2003)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Ciesielski, Krzysztof (2003)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Qi, Feng, Debnath, Lokenath (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Katsumi Wasaki (2008)
Formalized Mathematics
Similarity:
We continue to formalize the concept of the Generalized Full Addition and Subtraction circuits (GFAs), define the structures of calculation units for the Redundant Signed Digit (RSD) operations, then prove its stability of the calculations. Generally, one-bit binary full adder assumes positive weights to all of its three binary inputs and two outputs. We define the circuit structure of two-types n-bit GFAs using the recursive construction to use the RSD arithmetic logical units that...
Keiichi Miyajima, Takahiro Kato (2010)
Formalized Mathematics
Similarity:
This article extends the [10]. We define the sum and the product of the sequence of complex numbers, and formalize these theorems. Our method refers to the [11].
Nagarajan Subramanian, Umakanta Misra (2012)
Kragujevac Journal of Mathematics
Similarity:
Dutta, Hemen (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Kazuhisa Ishida (2008)
Formalized Mathematics
Similarity:
This article provides the definition of linear temporal logic (LTL) and its properties relevant to model checking based on [9]. Mizar formalization of LTL language and satisfiability is based on [2, 3].
Yatsuka Nakamura, Hisashi Ito (2008)
Formalized Mathematics
Similarity:
Here, we develop the theory of zero based finite sequences, which are sometimes, more useful in applications than normal one based finite sequences. The fundamental function Sgm is introduced as well as in case of normal finite sequences and other notions are also introduced. However, many theorems are a modification of old theorems of normal finite sequences, they are basically important and are necessary for applications. A new concept of selected subsequence is introduced. This concept...
Cemal Belen, Mustafa Yildirim (2012)
Kragujevac Journal of Mathematics
Similarity:
Z. Ratajczyk (1992)
Fundamenta Mathematicae
Similarity:
We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris-Harrington Theorem, and a version of the Solovay-Ketonen Theorem. We give uniform proofs using combinatorial constructions.
Brugia, Odoardo, Filipponi, Piero (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Szalay, I. (2002)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Umatul Samee (2011)
Kragujevac Journal of Mathematics
Similarity: