English
Related papers

Related papers: G\"odel's Notre Dame Course

200 papers

This paper investigates the proof-theoretic foundations of double negation introduction (DNI) and double negation elimination (DNE) in classical logic. By examining both sequent calculus and natural deduction, it is shown that these rules…

Logic in Computer Science · Computer Science 2025-09-23 Khashayar Irani

This book can be seen either as a text on theorem proving that uses techniques from general algebra, or else as a text on general algebra illustrated and made concrete by practical exercises in theorem proving. The book considers several…

Logic in Computer Science · Computer Science 2021-01-19 Joseph A. Goguen

I formalize important theorems about classical propositional logic in the proof assistant Coq. The main theorems I prove are (1) the soundness and completeness of natural deduction calculus, (2) the equivalence between natural deduction…

Logic · Mathematics 2015-04-01 Floris van Doorn

This note gives an informal overview of the proof in our paper "Borel Conjecture and Dual Borel Conjecture", see arXiv:1105.0823.

Logic · Mathematics 2011-12-20 Martin Goldstern , Jakob Kellner , Saharon Shelah , Wolfgang Wohofsky

These are the notes on two-dimensional conformal field theory, based on a lecture course for graduate math students, given by P.M. in fall 2022 at the University of Notre Dame. These notes are intended to be substantially reworked and…

Mathematical Physics · Physics 2025-01-22 Pavel Mnev

In 1918, Noether published a paper where she studied such a problem, now called Noether's problem on rationality: Let $L=K\left( t_{1},t_{2},\cdots ,t_{n}\right) $ be a purely transcendental extension over a field $K$ and $G$ a finite…

Number Theory · Mathematics 2019-09-09 Feng-Wen An

Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…

Logic in Computer Science · Computer Science 2024-11-26 Victoria Vollmer , Danielle Marshall , Harley Eades , Dominic Orchard

Is it possible to encompass the full extent of the universe within a theory based on a finite set of first principles and inference rules? The r\^{o}le of observers and observations in physics theories is considered here in the light of…

History and Philosophy of Physics · Physics 2021-08-04 Uri Ben-Ya'acov

This material complements David Chandler's Introduction to Modern Statistical Mechanics (Oxford University Press, 1987) in a graduate-level, one-semester course I teach in the Department of Chemistry at Duke University. Students enter this…

Statistical Mechanics · Physics 2017-05-22 Patrick Charbonneau

Following the lines of the analysis done in [BPZ07, BCF07] for first-order G\"odel logics, we present an analogous investigation for Nilpotent Minimum logic NM. We study decidability and reciprocal inclusion of various sets of first-order…

Logic · Mathematics 2012-07-03 Matteo Bianchi

This is a non-standard paper, containing some problems in set theory I have in various degrees been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me, sometimes the problems…

Logic · Mathematics 2007-05-23 Saharon Shelah

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…

Logic in Computer Science · Computer Science 2019-03-14 Guillaume Burel

In this course we introduce the main notions relative to the classical theory of modular forms. A complete treatise in a similar style can be found in the author's book joint with F. Str{\"o}mberg [1].

Number Theory · Mathematics 2018-10-01 Henri Cohen

These are the lecture notes for the introductory graduate course I taught at Yale during Spring 2007. I mostly followed [GS], [BGV], [AB], [Par2], and there are no original results in these notes.

Symplectic Geometry · Mathematics 2010-06-02 Matvei Libine

We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.

Logic · Mathematics 2009-05-07 René David , Karim Nour

The problem of the "common inessential discriminant divisors" attracted the attention of Dedekind, Kronecker, and Hensel in the early days of algebraic number theory. Four sources are particularly important: Dedekind's announcement, in…

History and Overview · Mathematics 2021-08-12 Fernando Q. Gouvêa , Jonathan Webster

Besides the better-known Nelson's Logic and Paraconsistent Nelson's Logic, in "Negation and separation of concepts in constructive systems" (1959), David Nelson introduced a logic called S with the aim of analyzing the constructive content…

Logic · Mathematics 2018-06-12 Thiago Nascimento , Umberto Rivieccio , João Marcos , Matthew Spinks

The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…

Combinatorics · Mathematics 2016-04-19 Nikolai V. Ivanov

This article--summarizing the authors' then novel formulation of General Relativity--appeared as Chapter 7 of an often cited compendium edited by L. Witten in 1962, which is now long out of print. Intentionally unretouched, this posting is…

General Relativity and Quantum Cosmology · Physics 2009-11-10 R. Arnowitt , S. Deser , C. W. Misner

We present nested sequent systems for propositional G\"odel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these…

Logic in Computer Science · Computer Science 2024-06-07 Tim S. Lyon