A judgmental reconstruction of modal logic

@article{Pfenning2001AJR,
  title={A judgmental reconstruction of modal logic},
  author={Frank Pfenning and Rowan Davies},
  journal={Mathematical Structures in Computer Science},
  year={2001},
  volume={11},
  pages={511 - 540}
}
We reconsider the foundations of modal logic, following Martin-Löf's methodology of distinguishing judgments from propositions. We give constructive meaning explanations for necessity and possibility, which yields a simple and uniform system of natural deduction for intuitionistic modal logic that does not exhibit anomalies found in other proposals. We also give a new presentation of lax logic and find that the lax modality is already expressible using possibility and necessity. Through a… 
View on Cambridge Press
cs.cmu.edu
370 Citations
Highly Influential Citations
38
Background Citations
150
Methods Citations
88
Results Citations
1

370 Citations

Citation Type

Citation Type

A judgmental analysis of linear logic
We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-L¨ of’s separation of judgments from propositions. Our construction yields a clean and elegant…
Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality
TLDR
This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them, and gives precise characterisations of the crucial notions of harmony and stability placed in the context of proving normalisation results in systems of natural deduction.
Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality
TLDR
This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them, and gives precise characterisations of the crucial notions of harmony and stability placed in the context of proving normalisation results in systems of natural deduction.
Categorical Judgments in a Logical Framework 15-816 Modal Logic
Categorical judgments possess a context-clearing property, making them difficult to express elegantly in the LF logical framework because the context of available LF hypotheses grows monotonically.…
A Linear-logical Reconstruction of Intuitionistic Modal Logic S4
TLDR
An extension of intuitionistic multiplicative exponential linear logic with a modality combining the S4 modality and the exponential modality is introduced, and it is shown that it admits a sound translation from IS4.
Hypothetical Logic of Proofs
TLDR
The Hypothetical Logic of Proofs is developed, a reformulation of LP based on judgemental reasoning that enjoys arithmetical soundness and completeness and is capable of reflecting its own proofs.
A Judgmental Deconstruction of Modal Logic
The modalities and© of necessary and lax truth described by Pfenning and Davies can be seen to arise from the same pair of adjoint logical operators F and U , which pass in both directions between…
Intuitionistic Hypothetical Logic of Proofs
Contextual modal type theory
TLDR
The consequences of relativizing contextual modal logic and its type-theoretic analogue to explicitly specified contexts are investigated.
The Focused Constraint Inverse Method for Intuitionistic Modal Logics
TLDR
A focused inverse method for proof search in a variety of intuitionistic modal logics such as K, D, T, S4 and S5 that have recently been proposed to reason about authorization and information flow security.
...
...

References

SHOWING 1-10 OF 61 REFERENCES
A Computational Interpretation of Modal Proofs
Proof theory of modal logics, though largely studied since the fifties, has always been a delicate subject, the main reason being the apparent impossibility to obtain elegant, natural systems for…
Propositional Lax Logic
TLDR
This paper investigates a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal verification of computer hardware, and investigates some of its proof-theoretic properties and defines a new class of fallible two-frame Kripke models for PLL.
Computational Types from a Logical Perspective
TLDR
This paper shows that the computational lambda calculus also arises naturally as the term calculus corresponding to a novel intuitionistic modal propositional logic and gives natural deduction, sequent calculus and Hilbert-style presentations of this logic and proves strong normalisation and confluence results.
On a Modal -calculus for S4 ?
TLDR
It is shown that, with respect to provability, this formulation of a proof term calculus for the intuitionistic modal logic S4 is equivalent to other formulations in the literature, sketch a simple type checking algorithm, and prove subject reduction and the existence of canonical forms for well-typed terms.
An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware
TLDR
A concrete and rather natural class of models from hardware verification such that the modality O models correctness up to timing constraints, and further shows soundness and completeness for several classes of fallible two-frame Kripke models.
A modal analysis of staged computation
TLDR
The main technical result is a conservative embedding of Nielson & Nielson's two-level functional language in the language Mini-ML, thus proving that binding-time correctness is equivalent to modal correctness on this fragment.
Monad as Modality
On a Modal λ-Calculus for S 4 ?
We present λ→2, a concise formulation of a proof term calculus for the intuitionistic modal logic S4 that is well-suited for practical applications. We show that, with respect to provability, it is…
On Natural Deduction
TLDR
The object of this paper is to present and justify a simplification of Gentzen's natural deduction method, to the end of enhancing the advantages just claimed.
First-order Lax Logic as a framework for Constraint Logic Programming
TLDR
A new proof theoretic approach to the semantics of Constraint Logic Programming based on an intuitionistic rst order modal logic called QLL is introduced, showing how the Lax Logic Programming LLP fragment of QLL can reveal abstractions behind CLP.
...
...