A formal framework for specifying sequent calculus proof systems-Reference-Cited by-同舟云学术

A formal framework for specifying sequent calculus proof systems

Published:2013-02 Issue: Volume:474 Page:98-116
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Miller Dale,Pimentel Elaine

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference48 articles.

1. D. Miller, G. Nadathur, A logic programming approach to manipulating formulas and programs, in: S. Haridi (Ed.), IEEE Symposium on Logic Programming, San Francisco, 1987, pp. 379–388. URL http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/slp87.pdf.

2. Specifying theorem provers in a higher-order logic programming language;Felty,1988

3. The foundation of a generic theorem prover;Paulson;Journal of Automated Reasoning,1989

4. R. Harper, F. Honsell, G. Plotkin, A framework for defining logics, in: 2nd Symp. on Logic in Computer Science, Ithaca, NY, 1987, pp. 194–204.

5. A framework for defining logics;Harper;Journal of the ACM,1993

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computational Logic for Biomedicine and Neurosciences;Symbolic Approaches to Modeling and Analysis of Biological Systems;2023-08-04

2. A system of inference based on proof search: an extended abstract;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. A new connective in natural deduction, and its application to quantum computing;Theoretical Computer Science;2023-05

4. A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems;Journal of Logical and Algebraic Methods in Programming;2023-01

5. An Analytic Propositional Proof System on Graphs;Logical Methods in Computer Science;2022-10-21