Modèles cumulatifs de la théorie des types
Modeling biased information seeking with second order probability distributions
Updating probabilities by information from only one hypothesis and thereby ignoring alternative hypotheses, is not only biased but leads to progressively imprecise conclusions. In psychology this phenomenon was studied in experiments with the “pseudodiagnosticity task”. In probability logic the phenomenon that additional premises increase the imprecision of a conclusion is known as “degradation”. The present contribution investigates degradation in the context of second order probability distributions....
Model-interpretability into trees and applications.
Modelling Real World Using Stochastic Processes and Filtration
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...
Models of linear logic
Model-theoretic properties of cause-and-effect structures
Modified modus ponens and modal logic
Modules over a quantale and models for the operator in linear logic
Molecules and linerly ordered ideals of MV-algebras.
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
Monotone (co)inductive types and positive fixed-point types
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
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
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].
MV-algebras with additive closure operators