University of Calgary

Slightly altering and extending McGee’s semantics for conditionals, we define a ternary notion of logical consequence for the validity of natural language arguments. The ternary logical consequence can be regarded as a unification of two kinds of...

In genetic epidemiology, log-linear models of population risk may be used to study the effect of genotypes and exposures on the relative risk of a disease. Such models may also include gene-environment interaction terms that allow the genotypes to...

The COVID-19 pandemic has illustrated both the utility and limitation of using epidemic models for understanding and forecasting disease spread. One of the many difficulties in modelling epidemic spread is that caused by behavioural change in the...

Linkage analysis maps genes for a heritable trait by identifying genomic regions with excess relatedness among individuals with similar trait values.Analysis may be conducted in families, or in unrelated individuals from a population. Here, we focus...

The Eilenberg-Zilber (EZ) theorem is a powerful tool in homological algebra and algebraic topology, being a key ingredient in the Kunneth theorem. It also serves as the basis for defining the cup product, which in turn establishes cohomology as a...

Given two isomorphic groups G and H, one may identify representations of H with representations of G along some fixed isomorphism from G to H. However, this process of identifying representations depends crucially on the isomorphism of groups one...

The goal of my talk is to sketch out an easy to follow, diagrammatic proof of the above statement.

In this talk, I will exposit some of the main ideas and results of the seminal 2017 paper “The pebbling comonad in finite model theory” by Samson Abramsky, Anuj Dawar, and Pengming Wang. In this paper, the authors demonstrate that pebble games, which...

I will provide a (very basic) tutorial on the Curry-Howard correspondence between proofs (in natural deduction) and terms in the typed λ-calculus. No prior knowledge of either will be presupposed.

Moses Schonfinkel invented “combinatory logic” — aka combinatory algebra (CA ) — in 1920. It consisted of a binary operation and two constants S and K (called combinators by Haskell Curry who further investigated CAs in the 1950s) which satisfy just...