Related papers: Logic Lectures: G\"odel's Basic Logic Course at No…
In an article dating back in 1992, Kosta Do\v{s}en initiated a project of modal translations in substructural logics, aiming at generalizing the well-known G\"{o}del-McKinsey-Tarski translation of intuitionistic logic into {\bf S4}.…
Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in G\"ottingen in 1921 with a thesis on the decision problem. In his thesis, he solved-independently of L\"owenheim and Skolem's earlier work-the decision problem…
Indexed Linear Logic has been introduced by Ehrhard and Bucciarelli, it can be seen as a logical presentation of non-idempotent intersection types extended through the relational semantics to the full linear logic. We introduce an…
Algorithmic information theory roots the concept of information in computation rather than probability. These lecture notes were constructed in conjunction with the graduate course I taught at Universit\`a della Svizzera italiana in the…
A logic program is an executable specification. For example, merge sort in pure Prolog is a logical formula, yet shows creditable performance on long linked lists. But such executable specifications are a compromise: the logic is distorted…
The past decade has witnessed two important new developments in the study of linear series on algebraic varieties. First, vector bundles have emerged as powerful tools for analyzing linear series on curves and surfaces. More recently, the…
G\"odel's ontological proof has been analysed for the first-time with an unprecedent degree of detail and formality with the help of higher-order theorem provers. The following has been done (and in this order): A detailed natural deduction…
We derive an intuitionistic version of G\"odel-L\"ob modal logic ($\sf{GL}$) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, $\sf{\ell IGL}$, by restricting a non-wellfounded labelled system for…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
These lecture notes form an expanded account of a course given at the Summer School on Topology and Field Theories held at the Center for Mathematics at the University of Notre Dame, Indiana during the Summer of 2012. A similar lecture…
In the 1950-ies P. F. Strawson proposed the Logic of Presuppositions. In this system sentences with empty subject are considered neither true nor false. Strawson considered only simple sentences with two predicate letters. But the concept…
Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…
Logic is one of the most male-dominated areas within the already hugely male-dominated subject of philosophy. Popular hypotheses for this disparity include a preponderance of confident, mathematically-minded male students in the classroom,…
G\"odel's Dialectica has been introduced and developed in the tradition of the so-called functional interpretations. Only recently has it been related with the a priori unrelated notion of differentiation, by taking a program-theoretic…
G\"odel's Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent…
First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…
The present paper proposes a new introductory treatment of the very well known Sahlqvist correspondence theory for classical modal logic. The first motivation for the present treatment is {\em pedagogical}: classical Sahlqvist…
Taking notes during lectures is one of the required skills, among many others, that students need (i) to master the topic covered in the lecture, (ii) to actively engage in the learning process with minimal to no distractions, (iii) to…
Given the emergent reasoning abilities of large language models, information retrieval is becoming more complex. Rather than just retrieve a document, modern information retrieval systems advertise that they can synthesize an answer based…
Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…