The Gödel–Löb provability logic GL is a modal logic that is complete with respect to transitive, conversely well-founded Kripke frames and, by Solovay's theorem, captures exactly the principles about provability in PA that PA itself proves. In this talk we ask what the infinitary counterpart of GL is, that is, what happens when the modal language is enriched with countably infi…
A basic challenge in futures studies is dealing with contradictory evidence and assessments which, though analytically important, may lead ordinary decision-making and scenario-building processes to discard data, oversimplify the problem, or struggle to assess the consistency of future options. The central question is how to use the informational content of conflicting evidence…
“The ordinary objects around us change over time, yet remain the same object they were before the change.” If Socrates takes his motorcycle to the garage and has the front tyre replaced, he seems quite sure that the motorcycle he rides home is the same one as before, indeed the very motorcycle Aristophanes gave him seven years ago. The example shows that our ordinary intuition…
I first review some basic notions of model theory and use them to study two different structures, one combinatorial and the other numerical in nature, pointing out various properties of these structures. I also show that in one of them, an interesting extension of Presburger arithmetic, one can speak of generalized Fibonacci sequences.
Afḍal al-Dīn al-Khūnajī is one of the most important logicians after Avicenna, whose works had a significant influence on the philosophers and logicians who came after him. In this talk I first give a systematic picture of Khūnajī's philosophical-logical project in comparison with Avicenna's, and then argue that Khūnajī's influence on later philosophers and logicians is, above…
Historically, during the first few decades of artificial intelligence research, two broad and largely independent traditions (paradigms) governed the theories of the field and the development of systems based on them: on one side, the connectionist tradition of learning based on statistical methods and artificial neural networks; on the other, the tradition of symbolic AI based…
Traditionally, computing systems have been specified mostly by stating requirements on their execution traces, also known as trace properties. To this end, researchers have made extensive use of temporal logics such as LTL and CTL and their extensions to express trace properties, and various methods have been proposed for verifying systems against such properties. However, not…
In classical logic, the connective “if and only if” plays a special role in forming the Lindenbaum algebra of a theory. Indeed, the biconditional in a sense defines a distance between propositions, and propositions at distance zero from each other fall into the same equivalence class of the Lindenbaum algebra. In t-norm based many-valued logics, too, the biconditional is closel…