scientific article

Publication date: 1979

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

algebraic semantics intuitionistic logic propositional calculus classical sentential calculus axiomatic and deductive systems without quantifiers constructive logical systems ultrafilter theory

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logical aspects of lattices and related structures (03G10) Classical propositional logic (03B05) Many-valued logic (03B50) Logical aspects of ?ukasiewicz and Post algebras (03G20)

Related Items (67)

Extensions of the minimal logic and the interpolation problem ⋮ Yankov Characteristic Formulas (An Algebraic Account) ⋮ The Lattice NExtS41 as Composed of Replicas of NExtInt, and Beyond ⋮ Almost structural completeness; an algebraic approach ⋮ Layers over minimal logic ⋮ Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ Three-element nonfinitely axiomatizable matrices ⋮ Synthesized substructural logics ⋮ On variable separation in modal and superintuitionistic logics ⋮ Topology and duality in modal logic ⋮ Abstract modal logics ⋮ The structure of lattices of subframe logics ⋮ Generalized compactness of nonmonotonic inference operations ⋮ Interpolation properties in the extensions of the logic of inequality ⋮ Finitary unification in locally tabular modal logics characterized ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ On extensions of intermediate logics by strong negation ⋮ Modal multilattice logic ⋮ Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework ⋮ Paraconsistent double negations as classical and intuitionistic negations ⋮ Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant ⋮ Satisfiability is false intuitionistically: a question from Dana Scott ⋮ Extending paraconsistent quantum logic: a single‐antecedent/succedent system approach ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Willem Blok and modal logic ⋮ Strong decidability and strong recognizability ⋮ Tableaux for logic programming with strong negation ⋮ Algebraic and relational semantics for tense logics ⋮ \(\mathbf{BK}\)-lattices. Algebraic semantics for Belnapian modal logics ⋮ 2-element matrices ⋮ LC and Its Pretabular Relatives ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems ⋮ Algebraization of quantifier logics, an introductory overview ⋮ Slices and levels of extensions of the minimal logic ⋮ The structure of slices over minimal logic ⋮ The tabularity problem over the minimal logic ⋮ Even more about the lattice of tense logics ⋮ Paraconsistent computation tree logic ⋮ Modal extension of ideal paraconsistent four-valued logic and its subsystem ⋮ Gnosis ⋮ A hierarchy of weak double negations ⋮ On the structure of paraconsistent extensions of Johansson's logic ⋮ Definability and interpolation in non-classical logics ⋮ Reflexive intermediate propositional logics ⋮ Frame based formulas for intermediate logics ⋮ Characteristic Formulas Over Intermediate Logics ⋮ Decidability of Some Interpolation Properties for Weakly Transitive Modal Logics ⋮ Lattice NExtS4 from the Embedding Theorem Viewpoint ⋮ Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality ⋮ On logics with coimplication ⋮ Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS ⋮ Unnamed Item ⋮ Meaning-preserving translations of non-classical logics into classical logic: between pluralism and monism ⋮ Falsification-aware semantics and sequent calculi for classical logic ⋮ Embedding friendly first-order paradefinite and connexive logics ⋮ On the structure of varieties with equationally definable principal congruences. I ⋮ An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi ⋮ Gentzen-type calculi for involutive quantales ⋮ Easkia Duality and Its Extensions ⋮ Modal tableau calculi and interpolation ⋮ Modalities and quantum mechanics ⋮ Gödel's completeness theorem ⋮ An almost general splitting theorem for modal logic ⋮ Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic

This page was built for publication: