scientific article; zbMATH DE number 1523418

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200008)46:3<417::AID-MALQ417>3.0.CO;2-T" /><417::AID-MALQ417>3.0.CO;2-T 10.1002/1521-3870(200008)46:3<417::AID-MALQ417>3.0.CO;2-TzbMath0960.03016OpenAlexW2295284441MaRDI QIDQ4511554

Abir Nour

Publication date: 28 February 2001

Full work available at URL: https://doi.org/10.1002/1521-3870(200008)46:3<417::aid-malq417>3.0.co;2-t

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

zbMATH Keywords

computational complexityrelational semanticsdeduction theoremsatisfiability problemcompleteness theoremKripke semanticsapproximation logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27)

Related Items (1)

The Tableau Method for a Logical System Based on a Finite Poset

This page was built for publication: