Faulty sets of Boolean formulas and ukasiewicz logic

DOI10.1093/LOGCOM/EXU073zbMATH Open1404.68170OpenAlexW2055148822MaRDI QIDQ2987063

Claudia Picardi, Daniele Mundici

Publication date: 17 May 2017

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exu073

zbMATH Keywords

NP-completenessapproximate reasoningBoolean logicpolynomial-time reductionreasoning under uncertaintyŁukasiewicz calculusstable consequenceRényi-Ulam gamesTwenty Questions with Liesunreliable premises

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Many-valued logic (03B50)

Related Items (1)

An error in a proof in: Boolean algebras with operators. I

This page was built for publication: Faulty sets of Boolean formulas and  ukasiewicz logic

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