Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker

DOI10.1016/S0020-0190(00)00219-2zbMath1032.68071OpenAlexW2048224177MaRDI QIDQ1603467

Jerzy Tyszkiewicz, Arthur Ramer, Piotr Chrząstowski-Wachtel, Achim G. Hoffmann

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00219-2

zbMATH Keywords

Combinatorial problemsInformation retrievalConditional eventsDefinability of connectivesThree-valued logic

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (1)

Deduction with uncertain conditionals

Cites Work

• On the logic of high probability
• An algebraic synthesis of the foundations of logic and probability
• Mathematics of data fusion
• An algebra of conditional events
• Toward a comprehensive theory of linguistic and probabilistic evidence: two new approaches to conditional event algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker