This project has revolved around creating a proof checker in python. This proof checker checks proofs that are written in the Hilbert-style as seen in the book Understanding Symbolic Logic by Klenk. It does a reasonably good job, but could also be expanded upon a great deal. Also, because this was only for a two credit class for one semester there were certain things that I was not able to do simply due to the fact that my time was limited. I will be going over what I did during this semester, some of the research that I did, and explaining some of the basics of formal languages and logic
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
AbstractThis paper is an exercise in program construction using Mathematics as a tool. The program w...
International audienceThe topics of structural proof theory and logic programming have influenced ea...
International audienceIn a world where trusting software systems is increasingly important, formal m...
AbstractThe kinds of inference rules and decision procedures that one writes for proofs involving eq...
International audienceThe kinds of inference rules and decision procedures that one writes for proof...
We present the design philosophy of a proof checker based on a notion of foundational proof certific...
The aim of computer proof checking is not to find proofs, but to verify them. This is different fro...
A proof is a successful demonstration that a conclusion necessarily follows by logical reasoning fro...
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline so...
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem...
The Proofchecker is a heuristically oriented computer program for checking mathematical proofs, with...
In this paper I will discuss the fundamental ideas behind proof assistants: What are they and what i...
International audienceWe present the design philosophy of a proof checker based on a notion of found...
International audienceThe earliest and most popular use of logic in computer science views computati...
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
AbstractThis paper is an exercise in program construction using Mathematics as a tool. The program w...
International audienceThe topics of structural proof theory and logic programming have influenced ea...
International audienceIn a world where trusting software systems is increasingly important, formal m...
AbstractThe kinds of inference rules and decision procedures that one writes for proofs involving eq...
International audienceThe kinds of inference rules and decision procedures that one writes for proof...
We present the design philosophy of a proof checker based on a notion of foundational proof certific...
The aim of computer proof checking is not to find proofs, but to verify them. This is different fro...
A proof is a successful demonstration that a conclusion necessarily follows by logical reasoning fro...
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline so...
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem...
The Proofchecker is a heuristically oriented computer program for checking mathematical proofs, with...
In this paper I will discuss the fundamental ideas behind proof assistants: What are they and what i...
International audienceWe present the design philosophy of a proof checker based on a notion of found...
International audienceThe earliest and most popular use of logic in computer science views computati...
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
AbstractThis paper is an exercise in program construction using Mathematics as a tool. The program w...
International audienceThe topics of structural proof theory and logic programming have influenced ea...