Giselle Reis

Publications37
h-index10
Citations277
Highly Influential Citations7
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Stefan Hetzl
  • 70 Publications • 805 Citations
  • Vivek Nigam
  • 121 Publications • 1,072 Citations
  • A. Leitsch
  • 113 Publications • 1,851 Citations
  • Dale Miller
  • 173 Publications • 3,636 Citations
  • Publications
  • Influence
Algorithmic introduction of quantified cuts
View PDF on arXiv
Introducing Quantified Cuts in Logic with Equality
TLDR
It is shown that the extension of the method to handle equality and quantifier-blocks leads to a substantial improvement of the old algorithm.
View PDF on arXiv
System Description: GAPT 2.0
GAPT General Architecture for Proof Theory is a proof theory framework containing data structures, algorithms, parsers and other components common in proof theory and automated deduction. In contrast…
View via Publisher
Formalized meta-theory of sequent calculi for linear logics
View via Publisher
Facilitating Meta-Theory Reasoning (Invited Paper)
  • Giselle Reis
  • Computer Science
    Electronic Proceedings in Theoretical Computer…
  • 16 July 2021
TLDR
This paper will present some techniques that I have been involved in for facilitating meta-theory reasoning, and their combinatorial nature suggests they could be automated.
View PDF on arXiv
An extended framework for specifying and reasoning about proof systems
TLDR
This paper shows how to extend the framework with subexponentials in order to declaratively encode a wider range of proof systems, including a number of non-trivial proof systems such as multi-conclusion intuitionistic logic, classical modal logic S4, intuitionistic Lax logic, and Negri’s labelled proof systems for different modal logics.
View via Publisher
Specifying Proof Systems in Linear Logic with Subexponentials
View via Publisher
Mechanizing Focused Linear Logic in Coq
View via Publisher
The Proof Certifier Checkers
TLDR
The architecture of Checkers is described and it is demonstrated how it can be used to check proof objects by supplying the fpc specification for a subset of the inferences used by eprover and checking proofs using these inferences.
View via Publisher
On the Generation of Quantified Lemmas
TLDR
An algorithmic method of lemma introduction based on an inversion of Gentzen’s cut-elimination method for sequent calculus capable of introducing several universal lemmas given a proof in predicate logic with equality.
View on Springer
...
...