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 38 Next

Displaying 741 – 760 of 1306

Showing per page

Probabilistic operational semantics for the lambda calculus

Ugo Dal Lago, Margherita Zorzi (2012)

RAIRO - Theoretical Informatics and Applications

Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...

Probabilistic operational semantics for the lambda calculus

Ugo Dal Lago, Margherita Zorzi (2012)

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

Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...

Probabilistic operational semantics for the lambda calculus

Ugo Dal Lago, Margherita Zorzi (2012)

RAIRO - Theoretical Informatics and Applications

Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...

Probabilistic propositional calculus with doubled nonstandard semantics

Ivan Kramosil (1999)

Kybernetika

The classical propositional language is evaluated in such a way that truthvalues are subsets of the set of all positive integers. Such an evaluation is projected in two different ways into the unit interval of real numbers so that two real-valued evaluations are obtained. The set of tautologies is proved to be identical, in all the three cases, with the set of classical propositional tautologies, but the induced evaluations meet some natural properties of probability measures with respect to nonstandard...

Product Pre-Measure

Noboru Endou (2016)

Formalized Mathematics

In this article we formalize in Mizar [5] product pre-measure on product sets of measurable sets. Although there are some approaches to construct product measure [22], [6], [9], [21], [25], we start it from σ-measure because existence of σ-measure on any semialgebras has been proved in [15]. In this approach, we use some theorems for integrals.

Program for generating fuzzy logical operations and its use in mathematical proofs

Tomáš Bartušek, Mirko Navara (2002)

Kybernetika

Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval [ 0 , 1 ] . Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program generating all finitely-valued fuzzy conjunctions ( t -norms). It allows also to select these t -norms according to...

Properties of extensions of algebraically maximal fields.

G. Leloup (2003)

Collectanea Mathematica

We prove some properties similar to the theorem Ax-Kochen-Ershov, in some cases of pairs of algebraically maximal fields of residue characteristic p > 0. This properties hold in particular for pairs of Kaplansky fields of equal characteristic, formally p-adic fields and finitely ramified fields. From that we derive results about decidability of such extensions.

Propositional Linear Temporal Logic with Initial Validity Semantics1

Mariusz Giero (2015)

Formalized Mathematics

In the article [10] a formal system for Propositional Linear Temporal Logic (in short LTLB) with normal semantics is introduced. The language of this logic consists of “until” operator in a very strict version. The very strict “until” operator enables to express all other temporal operators. In this article we construct a formal system for LTLB with the initial semantics [12]. Initial semantics means that we define the validity of the formula in a model as satisfaction in the initial state of model...

Pseudo B L -algebras and D R ℓ -monoids

Jan Kühr (2003)

Mathematica Bohemica

It is shown that pseudo B L -algebras are categorically equivalent to certain bounded D R ℓ -monoids. Using this result, we obtain some properties of pseudo B L -algebras, in particular, we can characterize congruence kernels by means of normal filters. Further, we deal with representable pseudo B L -algebras and, in conclusion, we prove that they form a variety.

(Pure) logic out of probability.

Ton Sales (1996)

Mathware and Soft Computing

Today, Logic and Probability are mostly seen as independent fields with a separate history and set of foundations. Against this dominating perception, only a very few people (Laplace, Boole, Peirce) have suspected there was some affinity or relation between them. The truth is they have a considerable common ground which underlies the historical foundation of both disciplines and, in this century, has prompted notable thinkers as Reichenbach [14], Carnap [2] [3] or Popper [12] [13] (and Gaifman [5],...

Currently displaying 741 – 760 of 1306