scientific article; zbMATH DE number 3659563
zbMATH Open0424.03007MaRDI QIDQ3858239FDOQ3858239
Authors: Wolfgang Rautenberg
Publication date: 1979
Title of this publication is not available (Why is that?)
intuitionistic logicalgebraic semanticspropositional calculusclassical sentential calculusaxiomatic and deductive systems without quantifiersconstructive logical systemsultrafilter theory
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical propositional logic (03B05) Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50) Logical aspects of lattices and related structures (03G10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Logical aspects of ?ukasiewicz and Post algebras (03G20)
Cited In (70)
- Yankov Characteristic Formulas (An Algebraic Account)
- Willem Blok and modal logic
- Characteristic formulas over intermediate logics
- Lattice NExtS4 from the embedding theorem viewpoint
- VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- The Lattice NExtS41 as Composed of Replicas of NExtInt, and Beyond
- Unification types and union splittings in intermediate logics
- Generalized compactness of nonmonotonic inference operations
- Bi-classical connexive logic and its modal extension: cut-elimination, completeness and duality
- Finitary unification in locally tabular modal logics characterized
- Tableaux for logic programming with strong negation
- Pretabularity and Craig's interpolation problem over the minimal logic
- A new logical characterisation of stable models and answer sets
- Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework
- Frame based formulas for intermediate logics
- Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
- Synthesized substructural logics
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- Algebraic and relational semantics for tense logics
- Paraconsistent computation tree logic
- Modal extension of ideal paraconsistent four-valued logic and its subsystem
- 2-element matrices
- Almost structural completeness; an algebraic approach
- The structure of lattices of subframe logics
- On the structure of paraconsistent extensions of Johansson's logic
- Strong decidability and strong recognizability
- Layers over minimal logic
- Topology and duality in modal logic
- Esakia duality and its extensions
- Gnosis
- Interpolation properties in the extensions of the logic of inequality
- Gödel's completeness theorem
- An almost general splitting theorem for modal logic
- Algebraization of quantifier logics, an introductory overview
- Abstract modal logics
- On the structure of varieties with equationally definable principal congruences. I
- \(\mathbf{BK}\)-lattices. Algebraic semantics for Belnapian modal logics
- On variable separation in modal and superintuitionistic logics
- On extensions of intermediate logics by strong negation
- Extending paraconsistent quantum logic: a single-antecedent/succedent system approach
- Three-element nonfinitely axiomatizable matrices
- Decidability of some interpolation properties for weakly transitive modal logics
- Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi
- Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
- Paraconsistent double negations as classical and intuitionistic negations
- Gentzen-type calculi for involutive quantales
- A hierarchy of weak double negations
- Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems
- Modal multilattice logic
- Modalities and quantum mechanics
- Definability and interpolation in non-classical logics
- Reflexive intermediate propositional logics
- On logics with coimplication
- Modal tableau calculi and interpolation
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- Even more about the lattice of tense logics
- Title not available (Why is that?)
- Falsification-aware semantics and sequent calculi for classical logic
- Meaning-preserving translations of non-classical logics into classical logic: between pluralism and monism
- Embedding friendly first-order paradefinite and connexive logics
- The structure of slices over minimal logic
- Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic
- Satisfiability is false intuitionistically: a question from Dana Scott
- Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation
- An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi
- Extensions of the minimal logic and the interpolation problem
- The tabularity problem over the minimal logic
- Slices and levels of extensions of the minimal logic
- LC and its pretabular relatives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858239)