All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 28 Next

Displaying 541 – 560 of 1306

Showing per page

Modelling Real World Using Stochastic Processes and Filtration

Peter Jaeger (2016)

Formalized Mathematics

First we give an implementation in Mizar [2] basic important definitions of stochastic finance, i.e. filtration ([9], pp. 183 and 185), adapted stochastic process ([9], p. 185) and predictable stochastic process ([6], p. 224). Second we give some concrete formalization and verification to real world examples. In article [8] we started to define random variables for a similar presentation to the book [6]. Here we continue this study. Next we define the stochastic process. For further definitions...

Molecules and linerly ordered ideals of MV-algebras.

C. S. Hoo (1997)

Publicacions Matemàtiques

We show that an ideal I of an MV-algebra A is linearly ordered if and only if every non-zero element of I is a molecule. The set of molecules of A is contained in Inf(A) ∪ B2(A) where B2(A) is the set of all elements x ∈ A such that 2x is idempotent. It is shown that I ≠ {0} is weakly essential if and only if B⊥ ⊂ B(A). Connections are shown among the classes of ideals that have various combinations of the properties of being implicative, essential, weakly essential, maximal or prime.

Monotone (co)inductive types and positive fixed-point types

Ralph Matthes (2010)

RAIRO - Theoretical Informatics and Applications

We study five extensions of the polymorphically typed lambda-calculus (system F) by type constructs intended to model fixed-points of monotone operators. Building on work by Geuvers concerning the relation between term rewrite systems for least pre-fixed-points and greatest post-fixed-points of positive type schemes (i.e., non-nested positive inductive and coinductive types) and so-called retract types, we show that there are reduction-preserving embeddings even between systems of monotone (co)inductive...

More on Divisibility Criteria for Selected Primes

Adam Naumowicz, Radosław Piliszek (2013)

Formalized Mathematics

This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].

Morley’s Trisector Theorem

Roland Coghetto (2015)

Formalized Mathematics

Morley’s trisector theorem states that “The points of intersection of the adjacent trisectors of the angles of any triangle are the vertices of an equilateral triangle” [10]. There are many proofs of Morley’s trisector theorem [12, 16, 9, 13, 8, 20, 3, 18]. We follow the proof given by A. Letac in [15].

N-Dimensional Binary Vector Spaces

Kenichi Arai, Hiroyuki Okazaki (2013)

Formalized Mathematics

The binary set {0, 1} together with modulo-2 addition and multiplication is called a binary field, which is denoted by F2. The binary field F2 is defined in [1]. A vector space over F2 is called a binary vector space. The set of all binary vectors of length n forms an n-dimensional vector space Vn over F2. Binary fields and n-dimensional binary vector spaces play an important role in practical computer science, for example, coding theory [15] and cryptology. In cryptology, binary fields and n-dimensional...

New applications of the wreath product of forest algebras

Howard Straubing (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We give several new applications of the wreath product of forest algebras to the study of logics on trees. These include new simplified proofs of necessary conditions for definability in CTL and first-order logic with the ancestor relation; a sequence of identities satisfied by all forest languages definable in PDL; and new examples of languages outside CTL, along with an application to the question of what properties are definable in both CTL and LTL.

Currently displaying 541 – 560 of 1306