Displaying 3481 – 3500 of 5989

Showing per page

Prime Ideal Theorems and systems of finite character

Marcel Erné (1997)

Commentationes Mathematicae Universitatis Carolinae

We study several choice principles for systems of finite character and prove their equivalence to the Prime Ideal Theorem in ZF set theory without Axiom of Choice, among them the Intersection Lemma (stating that if S is a system of finite character then so is the system of all collections of finite subsets of S meeting a common member of S ), the Finite Cutset Lemma (a finitary version of the Teichm“uller-Tukey Lemma), and various compactness theorems. Several implications between these statements...

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...

Problemas de decisión en ambiente difuso.

José Luis Verdegay Galdeano (1983)

Trabajos de Estadística e Investigación Operativa

Bajo un planteamiento difuso del Problema General de Decisión Unipersonal, se propone un método que permite definir una función de utilidad para este problema. Dicha función se muestra como una familia de funciones de utilidad, la cual se considera como la "utilidad difusa" que sirve para resolver el problema que se plantea en los distintos contextos.

Currently displaying 3481 – 3500 of 5989