Falsification-aware calculi and semantics for normal modal logics including S4 and S5

DOI10.1007/s10849-022-09386-7OpenAlexW4301368582MaRDI QIDQ6169323

Norihiro Kamide

Publication date: 14 August 2023

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-022-09386-7

zbMATH Keywords

completeness theoremcut-elimination theoremmodal logic S4modal logic S5falsification-aware (hyper)sequent calculusfalsification-aware Kripke semanticsNelson's constructive three-valued logic N3

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of philosophical logic. Vol. 8
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Dual intuitionistic logic and a variety of negations: the logic of scientific research
• A remark on Gentzen's calculus of sequents
• Applications of Kripke models to Heyting-Brouwer logic
• Intuitionistic logic with strong negation
• The logic of information structures
• Refutation systems in modal logic
• Dual-intuitionistic logic
• Refutations, proofs, and models in the modal logic K4
• Modal multilattice logic
• A formalization of the propositional calculus of H-B logic
• Semantics-based nonmonotonic inference
• A Łukasiewicz-style refutation system for the modal logic S4
• Modal extension of ideal paraconsistent four-valued logic and its subsystem
• Falsification-aware semantics and sequent calculi for classical logic
• Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation
• Falsification, natural deduction and bi-intuitionistic logic
• Hypersequent Calculi for S5: The Methods of Cut Elimination
• Embedding from multilattice logic into classical logic and vice versa
• On a multilattice analogue of a hypersequent S5 calculus
• Counterexample-guided abstraction refinement for symbolic model checking
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• Constructible falsity and inexact predicates
• The Logic of Contradiction
• Refutations in Wansing’s Logic
• A deductive-reductive form of logic: General theory and intuitionistic case
• Yet another paradefinite logic: The role of conflation1
• From Frame Properties to Hypersequent Rules in Modal Logics
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Constructible falsity

This page was built for publication: Falsification-aware calculi and semantics for normal modal logics including S4 and S5