scientific article

zbMath0978.03045MaRDI QIDQ2704221

Daniele Mundici, Ferdinando Cicalese, Ugo Vaccaro

Publication date: 31 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algebraic logicthree-valued logicalgebraic combinatoricsUlam-Rényi gamecommunication with feedbackŁukasiewicz calculusLindenbaum algebrasoptimal error-correcting codesbinary searches with faulty testscubic logicfault-tolerant searchesfinite cubic algebrasgame of Twenty Questionsguessing a number with lying

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Other algebras related to logic (03G25) Enumerative combinatorics (05A99) Information theory (general) (94A15) Many-valued logic (03B50) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial games (91A46) Communication theory (94A05)

Related Items (10)

\(Q\)-ary search with one Lie and bi-interval queries ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Searching with lies under error cost constraints ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice ⋮ Binary search with delayed and missing answers ⋮ Truth tellers and liars with fewer questions ⋮ Searching with lies under error transition cost constraints

This page was built for publication: