Pesca

PESCA = Proof Editor for Sequent Calculus: Pesca is a program that helps in the construction of proofs in sequent calculus. It works both as a proof editor and as an automatic theorem prover. Proofs constructed in Pesca can both be seen on the terminal and printed into LaTeX files. The user of Pesca can choose among different versions of classical and intuitionistic proposition and predicate calculi, and extend them by systems of nonlogical axioms. The implementation of Pesca is written in the functional programming language Haskell.


References in zbMATH (referenced in 126 articles )

Showing results 1 to 20 of 126.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. D’Agostino, Marcello; Gabbay, Dov; Modgil, Sanjay: Normality, non-contamination and logical depth in classical natural deduction (2020)
  2. Gherardi, Guido; Maffezioli, Paolo; Orlandelli, Eugenio: Interpolation in extensions of first-order logic (2020)
  3. Parlamento, Franco; Previale, Flavio: Absorbing the structural rules in the sequent calculus with additional atomic rules (2020)
  4. Ramos, Jaime; Rasga, João; Sernadas, Cristina: Essential structure of proofs as a measure of complexity (2020)
  5. Yu, Junhua: Lyndon interpolation theorem of instantial neighborhood logic-constructively via a sequent calculus (2020)
  6. Arndt, Michael: Eight inference rules for implication (2019)
  7. Bobzien, Susanne: Stoic sequent logic and proof theory (2019)
  8. del Carmen González Huesca, Lourdes; Miranda-Perea, Favio E.; Linares-Arévalo, P. Selene: Axiomatic and dual systems for constructive necessity, a formally verified equivalence (2019)
  9. Dong, Huimin; Gratzl, Norbert; Roy, Olivier: Open reading and free choice permission: a perspective in substructural logics (2019)
  10. Drobyshevich, Sergey: Disentangling structural connectives or life without display property (2019)
  11. Gratzl, Norbert; Orlandelli, Eugenio: Logicality, double-line rules, and modalities (2019)
  12. Indrzejczak, Andrzej: Fregean description theory in proof-theoretical setting (2019)
  13. Leszczyńska-Jasion, Dorota; Petrukhin, Yaroslav; Shangin, Vasilyi; Jukiewicz, Marcin: Functional completeness in (\mathbfCPL) via correspondence analysis (2019)
  14. Maffezioli, Paolo; Orlandelli, Eugenio: Full cut elimination and interpolation for intuitionistic logic with existence predicate (2019)
  15. Negri, Sara; von Plato, Jan: From mathematical axioms to mathematical rules of proof: recent developments in proof analysis (2019)
  16. Pavlović, Edi; Gratzl, Norbert: Proof-theoretic analysis of the quantified argument calculus (2019)
  17. Petrolo, Mattia; Pistone, Paolo: On paradoxes in normal form (2019)
  18. Rinaldi, Davide; Wessel, Daniel: Cut elimination for entailment relations (2019)
  19. Rosenblatt, Lucas: Noncontractive classical logic (2019)
  20. Standefer, Shawn: Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs (2019)

1 2 3 ... 5 6 7 next