scientific article; zbMATH DE number 3131074
From MaRDI portal
Publication:3247119
zbMATH Open0080.00701MaRDI QIDQ3247119FDOQ3247119
Authors: Masao Ohnishi, Kazuo Matsumoto 
Publication date: 1957
Title of this publication is not available (Why is that?)
Cited In (37)
- Loop-free calculus for modal logic S4. I
- Two proofs of the algebraic completeness theorem for multilattice logic
- Non-labelled sequent calculi of public announcement expansions of \textbf{K45} and \textbf{S5}
- Decision procedures for S3∘ and S4∘
- A dual-context sequent calculus for the constructive modal logic S4
- Title not available (Why is that?)
- A study of Kripke-type models for some modal logics by Gentzen's sequential method
- Modal extension of ideal paraconsistent four-valued logic and its subsystem
- Sequential method in propositional dynamic logic
- Modal multilattice logics with Tarski, Kuratowski, and Halmos operators
- Triangle algebras: A formal logic approach to interval-valued residuated lattices
- Labelled sequent calculi for Lewis' non-normal propositional modal logics
- Hypersequent calculi for S5: the methods of cut elimination
- Tautology elimination, cut elimination, and S5
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- Proof-theoretic results of common sense modal predicate calculi
- A study of some tense logics by Gentzen's sequential method
- Lyndon interpolation theorem of instantial neighborhood logic-constructively via a sequent calculus
- On a multilattice analogue of a hypersequent S5 calculus
- Varieties of Relevant S5
- A deep inference system for the modal logic S5
- Semantical approach to cut elimination and subformula property in modal logic
- Hintikka multiplicities in matrix decision methods for some propositional modal logics
- Combining intuitionistic and classical propositional logic: Gentzenization and Craig interpolation
- Resolution for some first-order modal systems
- Cut elimination for \(\mathrm{S4}_n\) and \(\mathrm{K4}_n\) with the central agent axiom
- Epistemic considerations of decision making in games
- Modal multilattice logic
- The bounded proof property via step algebras and step frames
- Full classical S5 in natural deduction with weak normalization
- On some intuitionistic modal logics
- On the proof theory of infinitary modal logic
- Some remarks on the proof-theory and the semantics of infinitary modal logic
- Focus-style proofs for the two-way alternation-free \(\mu \)-calculus
- Machine-checked proof-theory for propositional modal logics
- Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
- Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
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 Q3247119)
