Related papers: G\"odel's Notre Dame Course
These lecture notes survey the emerging area of Universal Proof Theory, which investigates general questions about the existence, equivalence, and characterization of good proof systems for broad classes of logics. In particular, the notes…
These are Notes prepared for nine lectures given at the Mathematical Sciences Research Institute, MSRI, Berkeley during the period January--March 1995. It is a pleasant duty to record here my gratitude to MSRI, and its staff, for making…
This paper has two goals. The first goal is to show how an extension of second-order logic is a natural framework to formalize portions of Aristotle's \emph{Topics} and to bring to the foreground the logical, linguistic and philosophical…
In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…
In this article we discuss the proof in the short unpublished paper appeared in the 3rd volume of Godel's Collected Works entitled "On undecidable sentences" (*1931?), which provides an introduction to Godel's 1931 ideas regarding the…
The motivation for this paper comes out of our experience with teaching natural deduction (ND) and with the way this formal system is implemented by the \textsc{Coq} proof assistant, namely by means of so-called tactics, which are…
This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…
The literature dealing with G\"{o}del's legacy is largely preoccupied with challenging his philosophical views, regarding them as outdated. We believe that such an approach prevents us from seeing G\"{o}del's views in the right light and…
Aristotle's discussions on modal syllogistic have often been viewed as error-prone and have garnered significant attention in the literature due to historical and philosophical interests. However, from a contemporary standpoint, they also…
This paper is around the topics I discussed in the lecture I gave at the Isaac Newton Institute in Cambridge, July 2009, in the Introductory Workshop. This paper can be read as a companion to my paper [Sa\"i di], where detailed proofs can…
The paper is devoted to the introduction of natural deduction systems for some weak subintuitionistic logics, along with proofs of normalization theorems for these systems.
In 1962 Charles Hartshorne published a modal logic proof formalizing Anselm of Canterbury's ontological argument for the necessary existence of God. This article presents Kurt G\"odel's notes on this proof which have now been discovered in…
We present the Natural Deduction Assistant (NaDeA) and discuss its advantages and disadvantages as a tool for teaching logic. NaDeA is available online and is based on a formalization of natural deduction in the Isabelle proof assistant. We…
Notes from 11 October 2004 lecture presented at the Joint Institute for Nuclear Astrophysics R-Matrix School at Notre Dame University.
Natural deduction systems, as proposed by Gentzen and further studied by Prawitz, is one of the most well known proof-theoretical frameworks. Part of its success is based on the fact that natural deduction rules present a simple…
G\"odel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum…
This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…
A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…
This report first shows the equivalence bewteen several formulations of classical logic in intuitionistic logic (tertium non datur, reductio ad absurdum, Pierce's law). Then it establishes the correctness of the G\"odel-Kolmogorov…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…