Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness

@inproceedings{Nakano2001FixedPointLW,
  title={Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness},
  author={Hiroshi Nakano},
  booktitle={TACS},
  year={2001}
}
We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and their specifications. The systems are based on the simple and the F-semantics of types, respectively, and correspond to the same modal logic, which is considered the intuitionistic version of the logic of provability. We also show Kripke completeness of the modal logic and its decidability, which implies the decidability of type… CONTINUE READING
BETA

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

A modality for recursion

  • H. Nakano
  • Proceedings of the 15th IEEE Symposium on Logic…
  • 2000
Highly Influential
5 Excerpts

A modality for recursion (technical report)

  • H. Nakano
  • Available as http:// www602.math.ryukoku.ac.jp…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…