Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games

DOI10.1016/S0304-3975(98)00349-1MaRDI QIDQ1978507zbMATH OpenFDO

Authors Brunella Gerla

Publication date 4 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(98)00349-1

zbMATH Keywords

conditional statesconditioning under uncertaintyDempster composition ruleentropygame of twenty questions with liesinformation-theoretic contentMV-algebrasUlam game

Mathematics Subject Classification ID

MV-algebras (06D35) Combinatorial games (91A46) Information theory (general) (94A15)

Review text

The game of twenty questions with lies, first considered by Ulam and Rényi, is an important chapter of the theory of error correcting codes with feedback. See the survey paper by \textit{F. Cicalese, U. Vaccaro} and the present reviewer [``Rota-Metropolis cubic logic and Ulam-Rényi games, in: D. Senato (ed.), Proceedings of a Conference held in Maratea, Italy, in Memoriam Gian-Carlo Rota (Springer-Verlag) (to appear)]. The Ulam-Rényi game also yields a natural semantics for Łukasiewicz many-valued logic. See the monograph of \textit{R. Cignoli, I. M. L. D'Ottaviano} and \textit{D. Mundici} [Algebraic foundations of many-valued reasoning (Trends in Logic -- Studia Logica Library 7, Kluwer, Dordrecht) (2000; Zbl 0937.06009)]. The present paper is essentially concerned with the following problem: ``How should one bet in a Ulam-Rényi game with lies? The appropriate many-valued notions of state and conditional state are applied to an analysis of the information-theoretic content of the game, in the light of Dempster's rule. For optimal search strategies to find the unknown number with random lies, one must ask those questions ensuring that entropy is balanced between positive and negative answers.

Recommendations

• MV-algebras, multiple bets and subjective states
• scientific article; zbMATH DE number 57852
• scientific article; zbMATH DE number 7591
• scientific article; zbMATH DE number 795167
• Rényi-Ulam Game Semantics for Product Logic and for the Logic of Cancellative Hoops
• scientific article; zbMATH DE number 512984
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• scientific article; zbMATH DE number 1577986
• scientific article; zbMATH DE number 2019877
• On semantic games for Łukasiewicz logic

Cites work

• A New Proof of the Completeness of the Lukasiewicz Axioms
• Algebraic Analysis of Many Valued Logics
• Averaging the truth-value in Łukasiewicz logic
• scientific article; zbMATH DE number 3547240 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 3282350 (Why is no real title available?)
• scientific article; zbMATH DE number 3323559 (Why is no real title available?)
• Logic of infinite quantum systems
• Optimal comparison strategies in Ulam's searching game with two errors
• Probability measures of fuzzy events

Cited in

(8)

• MV-algebras, multiple bets and subjective states
• scientific article; zbMATH DE number 440109 (Why is no real title available?)
• On the algebraic structure of conditional events
• scientific article; zbMATH DE number 7591 (Why is no real title available?)
• scientific article; zbMATH DE number 57852 (Why is no real title available?)
• scientific article; zbMATH DE number 795167 (Why is no real title available?)
• Rényi-Ulam Game Semantics for Product Logic and for the Logic of Cancellative Hoops
• Searching games with errors -- fifty years of coping with liars

This page was built for publication: Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978507)