A judgmental reconstruction of modal logic

From MaRDI portal
Publication:2746757

DOI10.1017/S0960129501003322zbMath0997.03020OpenAlexW1988824860WikidataQ55933437 ScholiaQ55933437MaRDI QIDQ2746757

Rowan Davies, Frank Pfenning

Publication date: 11 November 2002

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129501003322




Related Items (68)

Proof-theoretic semantics, a problem with negation and prospects for modalityJ-Calc: a typed lambda calculus for intuitionistic justification logicIntuitionistic hypothetical logic of proofsAdjoint Logic with a 2-Category of ModesA dual-context sequent calculus for the constructive modal logic S4On interactive proof-search for constructive modal necessityModalities Without WorldsType-safe higher-order channels with channel localityEmbedding Constructive K into Intuitionistic KUnnamed ItemProofs, Upside DownOn the relations between monadic semanticsSUBATOMIC INFERENCES: AN INFERENTIALIST SEMANTICS FOR ATOMICS, PREDICATES, AND NAMESUnnamed ItemNormalization by evaluation for modal dependent type theoryA proof-theoretic universal property of determinersA proof-theoretic semantics for exclusionJustification logic as a foundation for certifying mobile computationA general framework for the semantics of type theoryA modal type theory for formalizing trusted communicationsUNDER LOCK AND KEY: A PROOF SYSTEM FOR A MULTIMODAL LOGICMorpho-logic from a topos perspective -- application to symbolic AIProof-theoretic harmony: towards an intensional accountDeriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of controlA note on harmonyProofs of randomized algorithms in CoqDual and axiomatic systems for constructive S4, a formally verified equivalenceA framework for linear authorization logicsOn the Semantics of IntensionalityPrograms Using Syntax with First-Class BindersUnnamed ItemCall-by-name Gradual Type TheoryHoare type theory, polymorphism and separationBilateralism in proof-theoretic semanticsA logic inspired by natural language: quantifiers as subnectorsMaehara-style modal nested calculiAdjoint reactive GUI programmingBrouwer's fixed-point theorem in real-cohesive homotopy type theoryFibrational modal type theoryOn harmony and permuting conversionsGeneral-elimination stabilityClassical natural deduction for S4 modal logicHypothetical logic of proofsHarmony in multiple-conclusion natural-deductionSelective Memoization with Box TypesOn the unity of dualitySubatomic natural deduction for a naturalistic first-order language with non-primitive identityUnnamed ItemBoxes go bananas: Encoding higher-order abstract syntax with parametric polymorphismThe Logic of Proofs as a Foundation for Certifying Mobile ComputationA general method for proving decidability of intuitionistic modal logicsJudgmental subtyping systems with intersection types and modal typesUnnamed ItemUnnamed ItemFocused and Synthetic Nested SequentsUnnamed ItemProof search and certificates for evidential transactionsA Curry–Howard View of Basic Justification LogicA Linear-Logical Reconstruction of Intuitionistic Modal Logic S4Axiomatic and dual systems for constructive necessity, a formally verified equivalenceCut-free Gentzen calculus for multimodal CKA modal logic internalizing normal proofsETA-RULES IN MARTIN-LÖF TYPE THEORYProof-Theoretic Semantics and FeasibilityUnnamed ItemConstructive Modalities with Provability SmackSpecifying Properties of Concurrent Computations in CLFCATEGORICAL HARMONY AND PATH INDUCTION




This page was built for publication: A judgmental reconstruction of modal logic