Results 1  10
of
12
A computationally efficient approximation of DempsterShafer theory
, 1988
"... An often mentioned obstacle for the use of DempsterShafer theory for the handling of uncertainty in expert systems is the computational complexity of the theory. One cause of this complexity is the fact that in DempsterShafer theory the evidence is represented by a belief function which is induced ..."
Abstract

Cited by 64 (0 self)
 Add to MetaCart
An often mentioned obstacle for the use of DempsterShafer theory for the handling of uncertainty in expert systems is the computational complexity of the theory. One cause of this complexity is the fact that in DempsterShafer theory the evidence is represented by a belief function which is induced by a basic probability assignment, i.e. a probability measure on the powerset of possible answers to a question, and not by a probability measure on the set of possible answers to a question, like in a Bayesian approach. In this paper, we define a Bayesian approximation of a belief function and show that combining the Bayesian approximations of belief functions is computationally less involving than combining the belief functions themselves, while in many practical applications replacing the belief functions by their Bayesian approximations will not essentially affect the result.
Interpretability logic
 Mathematical Logic, Proceedings of the 1988 Heyting Conference
, 1990
"... Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbertstyle programs. Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbertstyle programs. Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength of theories, or better to prove
1 MANUFACTURING A CARTESIAN CLOSED CATEGORY WITH EXACTLY TWO OBJECTS OUT OF A CMONOID
"... We answer a question of Lambek and Scott (see [LS] p.99) by proving the following: Theorem. Let 9vt be a Cmonoid, with Cstructure (7t, 7t', £, (_)*, <_,_>). Then there exists a cartesian closed category A with exactly two objects U and T, such that End(U) =!M The construction of. is en ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We answer a question of Lambek and Scott (see [LS] p.99) by proving the following: Theorem. Let 9vt be a Cmonoid, with Cstructure (7t, 7t', £, (_)*, <_,_>). Then there exists a cartesian closed category A with exactly two objects U and T, such that End(U) =!M The construction of. is entirely by hand. The intuitive idea is as follows.!may be viewed as a collection of endomorphisms of a set U. Let T _ { *I be a onepoint set; then u X*.u is a onetoone correspondence between U and the set of all functions from T to U. Now if. is a cartesian closed category with just U and T for its objects, where T is terminal, then in A we must have Hom(U,U) = Hom(TxU,U) = Hom(T,UU) = _ Hom(T,U); so if we put Hom(U,U) = iM, and like to think of Hom(T,U) as HomSets({*},U), we must have M _ U, as sets. Since it does not matter much what the elements of U are, we take M=U. Then we have functions ft _ k*.f: ku.*:U{*}, we have (X*.f) o (ku.*) = ku f: U U. *I U for every f E U. Composing with o
SPECIFICATION! OF THE FAST FOURIER TRANSFORM ALGORITHM AS A TERM REWRITING SYSTEM
, 1987
"... Depa. tmeht o jPh:.foph y ty a3 4eeh Uvu.velmj aftovcc:ngen D:Hoeh.zema Depantmen;s o Phyzia and Phita4vphy ..."
Abstract
 Add to MetaCart
Depa. tmeht o jPh:.foph y ty a3 4eeh Uvu.velmj aftovcc:ngen D:Hoeh.zema Depantmen;s o Phyzia and Phita4vphy
University of UtrechtINTERPOLATION IN A FRAGMENT OF INTUITIONISTIC PROPOSITIONAL LOGIC
"... Univvz... ty o6 ULicechx. Let NNIL (No Nestings of Implication to the Left) be the fragment of IpL (intuitionistic propositional logic) in which the antecedent of any implication is always prime. The following strong interpolation theorem is proved: if IpL}A+B and A or B is in NNIL, then there is a ..."
Abstract
 Add to MetaCart
Univvz... ty o6 ULicechx. Let NNIL (No Nestings of Implication to the Left) be the fragment of IpL (intuitionistic propositional logic) in which the antecedent of any implication is always prime. The following strong interpolation theorem is proved: if IpL}A+B and A or B is in NNIL, then there is an interpolant I in KNIT The proof consists in constructing I from a proof of A+B in a sequent calculus system by means of a variant of a method devised by K. Schutte. This settles a question posed by A.
iO
, 1987
"... $os, * soy x,71 ly`y Department of Philosophy University of UtrechtApplications of constructive logic to sheaf constructions in toposes Paper corresponding to the talk delivered at ..."
Abstract
 Add to MetaCart
$os, * soy x,71 ly`y Department of Philosophy University of UtrechtApplications of constructive logic to sheaf constructions in toposes Paper corresponding to the talk delivered at
University of UtrechtA DESCENDING HIERARCHY OF REFLECTION PRINCIPLES
, 1988
"... This paper can best be viewed as a portrait in miniature of a fascinating structure: a. descending hierarchy of reflection principles. Ascending hierarchies of reflection principles are amply studied, e.g. in Feferman's great paper Transfinite Recursive Progressions of Axiomatic Theories (Fefer ..."
Abstract
 Add to MetaCart
This paper can best be viewed as a portrait in miniature of a fascinating structure: a. descending hierarchy of reflection principles. Ascending hierarchies of reflection principles are amply studied, e.g. in Feferman's great paper Transfinite Recursive Progressions of Axiomatic Theories (Feferman[l962]). The problem adressed in the study of ascending hierarchies is: what is the a
Arithmetic Analogues of McAloon's Unique Rosser Sentences
, 1988
"... It is always annoying to read what someone else has to say about one's papers. The writer usually a reviewer inevitably picks out some small point of tangential interest and expands on it. Such is what I intend to do to McAloon 1975 here: McAloon prefaces his paper with an abstract which do ..."
Abstract
 Add to MetaCart
It is always annoying to read what someone else has to say about one's papers. The writer usually a reviewer inevitably picks out some small point of tangential interest and expands on it. Such is what I intend to do to McAloon 1975 here: McAloon prefaces his paper with an abstract which does not even mention the result on which I, perversely enough, wish to focus. This result, as is so subtly hinted in the title of the present note, is the uniqueness of a certain kind of Rosser sentence for ZF. Rosser's original sentence is easily described. Let Prov(x,y) express "x proves y (or, more precisely: the derivation coded by x proves the formula coded by y "). The Rosser sentence is then any sentence (p provably satisfying cp