On the completeness of first degree weakly aggregative modal logics

DOI10.1023/A:1017940015180MaRDI QIDQ1362596zbMATH OpenFDO

Authors Peter Apostoli

Publication date 5 November 1997

Published in Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

completenessdecidabilityfiltrationcanonical modelweakly aggregative modal logic

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Modal logic (including the logic of norms) (03B45)

Recommendations

• A solution to the completeness problem for weakly aggregative modal logic
• Conjunctive normal forms and weak modal logics without the axiom of necessity
• Publication:3315479
• Finite models constructed from canonical formulas
• Modal Aggregation and the Theory of Paraconsistent Filters

Cites work

• scientific article; zbMATH DE number 4137751 (Why is no real title available?)
• scientific article; zbMATH DE number 4033710 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• A solution to the completeness problem for weakly aggregative modal logic
• Inference and necessity
• Intensional logics without iterative axioms
• Some remarks on (weakly) weak modal logics
• The n-adic first-order undefinability of the Geach formula
• The preservation of coherence
• Universal First‐Order Definability in Modal Logic

Cited in

(2)

• A solution to the completeness problem for weakly aggregative modal logic
• Model theoretical aspects of weakly aggregative modal logic

This page was built for publication: On the completeness of first degree weakly aggregative modal logics

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