Introduction to Pylog

04/04/2023
by   Clarence Lewis Protin, et al.
0

PyLog is a minimal experimental proof assistant based on linearised natural deduction for intuitionistic and classical first-order logic extended with a comprehension operator. PyLog is interesting as a tool to be used in conjunction with other more complex proof assistants and formal mathematics projects (such as Coq and Coq-based projects). Proof assistants based on dependent type theory are at once very different and profoundly connected to the one employed by Pylog via the Curry-Howard correspondence. The Tactic system of Coq presents us with a top-down approach to proofs (finding a term inhabiting a given type via backtracking the rules, typability and type-inference being automated) whilst the classical approach of Pylog follows how mathematical proofs are usually written. Pylog should be further developed along the lines of Coq in particular through the introduction of many "micro-automatisations" and a nice IDE.

READ FULL TEXT
research
03/28/2020

Sahlqvist Correspondence Theory for Instantial Neighbourhood Logic

In the present paper, we investigate the Sahlqvist-type correspondence t...
research
03/21/2021

Formal verification of Zagier's one-sentence proof

We comment on two formal proofs of Fermat's sum of two squares theorem, ...
research
04/20/2018

Formalising Mathematics In Simple Type Theory

Despite the considerable interest in new dependent type theories, simple...
research
07/24/2023

A system of inference based on proof search: an extended abstract

Gentzen designed his natural deduction proof system to “come as close as...
research
07/03/2023

Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations

In this paper I will develop a lambda-term calculus, lambda-2Int, for a ...
research
02/20/2023

A modest proposal: explicit support for foundational pluralism

Whilst mathematicians assume classical reasoning principles by default t...
research
08/29/2023

Sharing proofs with predicative theories through universe polymorphic elaboration

As the development of formal proofs is a time-consuming task, it is impo...

Please sign up or login with your details

Forgot password? Click here to reset