Related papers: Logic Lectures: G\"odel's Basic Logic Course at No…
Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The Journal of Symbolic Logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…
We present a new English translation of L.E.J. Brouwer's paper `De onbetrouwbaarheid der logische principes' (The unreliability of the logical principles) of 1908, together with a philosophical and historical introduction. In this paper…
In their account of theory change in logic, Aberdein and Read distinguish 'glorious' from 'inglorious' revolutions--only the former preserves all 'the key components of a theory' [1]. A widespread view, expressed in these terms, is that…
This paper revisits the foundations of mathematical proof through the lens of Aristotle's threefold conception of truth: sensory evidence, axiomatic definition, and syllogistic deduction. I argue that modern mathematics has too often…
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…
The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…
This is a set of 288 questions written for a Moore-style course in Mathematical Logic. I have used these (or some variation) four times in a beginning graduate course. Topics covered are: propositional logic axioms of ZFC wellorderings and…
It is nowadays common to consider that proof must be part of the learning of mathematics from Kindergarten to University1. As it is easy to observe, looking back to the history of mathematical curricula, this has not always been the case…
Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…
The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…
In the present essay we attempt to reconstruct Newtonian mechanics under the guidance of logical principles and of a constructive approach related to the genetic epistemology of J. Piaget and R. Garc\'ia \citep{piag89}. Instead of…
We describe an approach for compiling preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and in which preferences among rules are…
Standard expositions of Goedel's 1931 paper on undecidable arithmetical propositions are based on two presumptions in Goedel's 1931 interpretation of his own, formal, reasoning - one each in Theorem VI and in Theorem XI - which do not meet…
This paper tries to justify the relevance of an introductory course in Mathematical Logic in the Philosophy curriculum for analyzing philosophical arguments in natural language. It is argued that the representation of the structure of…
Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…
Logical reasoning is central to human cognition and intelligence. It includes deductive, inductive, and abductive reasoning. Past research of logical reasoning within AI uses formal language as knowledge representation and symbolic…
Inconsistency Robustness is performance of information systems with pervasively inconsistent information. Inconsistency Robustness of the community of professional mathematicians is their performance repeatedly repairing contradictions over…
These are the lecture notes that accompanied the course of the same name that I taught at the Eindhoven University of Technology from 2021 to 2023. The course is intended as an introduction to neural networks for mathematics students at the…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and…