Events in 2026-2027 Spring Semester
Our understanding of time, including the future, is grounded in a universal perception shared across cultures. However, the ways in which this universal perception is comprehended differ significantly, shaped by the linguistic structures of various languages and the broader culturally conditioned frameworks of reference they are part of. These differences in comprehension give rise to diverse models of the future, offering unique insights into alternative perspectives on the metaphysics of time and its relation to the philosophy of action. This paper explores these alternative perspectives through a comparative analysis of the Later Mohist view from ancient Chinese thought and St. Augustine’s introspective framework, influential in Western philosophy. By employing the method of transcultural comparative sublation, the lecture will uncover the strengths and limitations of each perspective, showing how diverse approaches to time deepen our understanding of the future as both a realm of possibility and a structural feature of reality. This dialogue encourages critical reflection on human agency, ethics, and the role of time in shaping existence, potentially revealing new perspectives on their interconnections and implications.
About the speaker: Professor Jana S. Rošker studied Sinology and earned her PhD at the University of Vienna. She is the first Slovene sinologist, as well as the co-founder and long-standing Head of the Department of Asian Studies at the University of Ljubljana. Altogether, she has spent more than ten years in China conducting research and teaching at various universities and research institutes.
A proof of a theorem can be said to be pure if it draws only on what is “close” or “intrinsic” to that theorem. In this talk, we will introduce the apparent preference for pure proofs that has persisted in mathematics since antiquity, alongside a competing preference for impurity. After giving an example from number theory and a brief history of purity in mathematics, we will distinguish four types of purity, based on different measures of distance between theorem and proof. We will then discuss reasons for preferring pure proofs, for the varieties of purity constraints that we have presented.
This talk is about a project where we aim to explore the concept of ultimate ignorance of an agent, depending on the underlying logic of knowledge. By “ultimate ignorance” we mean an operator obtained by iterating the ignorance operator \mathcal{L} (possibly transfinitely), where \mathcal{L} _\varphi intuitively saying that “The agent is ignorant whether \varphi is true”, until stabilisation up to logical equivalence, if that stabilisation ever occurs.
Here, we set the stage for the project and explore the logical behaviour of the finite hierarchy of ignorance \mathcal{L}, \mathcal{L}^2, . . . and its limit operator \mathcal{L}^\omega and demonstrate that, contrary to common expectation, that behaviour is generally rather complex, both in terms of the valid consequences between these operators and in terms of the semantic conditions corresponding to the respective implications between them, over relatively weaker underlying logics of knowledge.
This is joint work with Hans van Ditmarsch and Yanjing Wang.
In this talk, I will introduce a rule-based semantics for causal reasoning and a family of modal languages interpreted through this semantics, built around the concept of causal necessity. I will use these languages to formalize causal concepts, including actual causality and counterfactual conditionals. I will then present techniques for automating these languages, based on satisfiability and model checking. Time permitting, I will illustrate how these languages and decision procedures can be applied to causal reasoning in the legal domain. My talk is based on a paper recently published in the Journal of Artificial Intelligence Research (JAIR) and available at https://www.jair.org/index.php/jair/article/view/18960
We examine the question through the lens of modern and future Set Theory.
About the speaker: William Hugh Woodin is an American mathematician and set theorist at Harvard University. He has made many notable contributions to the theory of inner models and determinacy. A type of large cardinals, the Woodin cardinals, bear his name. In 2023, he was elected to the National Academy of Sciences.
Much work has been done to develop one system of inductive logic or another, but there has been much less discussion of what inductive logic should be—or should not be—at a high level of generality. Accordingly, this talk formulates, sharpens, and addresses some foundational problems in inductive logic, while being careful about how those problems are interrelated. The problems I have in mind include the following: (1) Should inductive logic be formal (like deductive logic) or material? (2) Should inductive logic concern a binary relation between sets of premises and conclusions (like deductive logic) or a ternary relation? (3) How should inductive logic be related to other branches of logic, such as deductive logic and nonmonotonic logic? (4) Should inductive logic incorporate probability theory and, if so, how—for example, in a Bayesian or Peircean way?
About the speaker: Hanti Lin is a philosopher of science and formal epistemologist, with papers published in philosophy as well as theoretical computer science. Before he joined UC Davis, he was a postdoc at the Australian National University.
Events in 2025-2026 Fall Semester
Abstract:
In game theory, an elementary and fundamental class of games is impartial combinatorial games (ICGs). The majority of classical and interesting ICGs are LIA-definable and terminating. One of the challenging and long-standing problems of ICGs is to compute winning strategies for possibly infinite number of winning states. To this end, we first propose a logical framework to formalize ICGs based on the linear integer arithmetic fragment of numeric part of PDDL. We then propose two approaches to generating the winning formula that exactly captures the states in which the player can force to win. Furthermore, we compute winning strategies for ICGs based on the winning formula. Experimental results on several games demonstrate the effectiveness of our approach.
Abstract:
In game theory, an elementary and fundamental class of games is impartial combinatorial games (ICGs). The majority of classical and interesting ICGs are LIA-definable and terminating. One of the challenging and long-standing problems of ICGs is to compute winning strategies for possibly infinite number of winning states. To this end, we first propose a logical framework to formalize ICGs based on the linear integer arithmetic fragment of numeric part of PDDL. We then propose two approaches to generating the winning formula that exactly captures the states in which the player can force to win. Furthermore, we compute winning strategies for ICGs based on the winning formula. Experimental results on several games demonstrate the effectiveness of our approach.
Abstract:
In this paper I apply the new Pragmatics to Assertions. Contrary to the prevalent perspective of viewing assertions, viz., epistemic, I argue that assertions are Pragmatic and moreover, are constitutively Pragmatic (in the type of Pragmatics to which our specific Pragmatics belongs). This perspective will cast a new light on whether there is a constitutive Epistemic Norm of Assertion (Williamson). We’ll explore various new features of assertions, viewed from this perspective.
Abstract:
In this paper I apply the new Pragmatics to Assertions. Contrary to the prevalent perspective of viewing assertions, viz., epistemic, I argue that assertions are Pragmatic and moreover, are constitutively Pragmatic (in the type of Pragmatics to which our specific Pragmatics belongs). This perspective will cast a new light on whether there is a constitutive Epistemic Norm of Assertion (Williamson). We’ll explore various new features of assertions, viewed from this perspective.
Abstract:
Bi-intuitionistic logic is intuitionistic logic with co-implication , which is a logical connective dual to usual implication. Roughly speaking, while
![]()
must hold between conjunction and implication,
![]()
must hold between disjunction and co-implication. In classical logic, as means , nothing interesting will occur by introducing co-implication. The main aim of my talk is to examine how intuitionistic world will be affected by the introduction of co-implication, by checking basic logical properties of extensions of BiInt in comparison with those of extensions of intuitionistic logic.
First, we will discuss the subject from syntactical aspects, that include (cut-free) sequent formulation, (local) deduction theorems, and also negative translation. Next we will focus our attention on the symmetry features peculiar to extensions of BiInt. It is pointed out that an interesting duality exists between a given logic and its mirror image, which can preserves some interesting logical properties. Also, algebraic approaches based on bi-Heyting algebras will be discussed.
Events in 2024-2025 Spring Semester
Abstract:
Scholars have long been captivated by repetitive and parallel structures in early Chinese texts. They have described, classified and defined repetitive and parallel figures in these texts and offered explanations of the function and operating principles of these figures. This talk critically engages with such explanations and explores new pathways of analysis in this field. In a first part, the talk provides a short historical overview of methods and theories that explain literary repetitions and parallelisms either as a reflection of structures that exist outside of the texts or with regard to their literary effects on the readers. Subsequently, the talk offers an own approach emphasising time and space aspects of repetitive and parallel structures in early Chinese philosophical texts, arguing that such structures construct a spatial dimension in these texts. In doing so, the talk argues, they go beyond what Ricoeur calls the “Model of the Text” and produce textual objects more akin to the spatial mode of visual objects and ritual performances. In its final part, the talk conducts an analysis of visual materials to illustrate how they reinforce, complement, or even inspire novel perspectives on the geometrical logic of repetition and parallelism within texts. It first explores scholarly conceptual discourse surrounding repetition and parallelism in ornamentation before finally turning to an analysis of Han mural art to discuss basic principles of composition in early Chinese textual and visual art and the roles that repetition and parallelism play to construct meaning therein.
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract:
Abstract: