Related papers: The Conrad Program: From l-groups to algebras of l…
In this joint introduction to an Asterisque volume, we give a short discussion of the historical developments in the study of nonlinear covering groups, touching on their structure theory, representation theory and the theory of automorphic…
Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with…
The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…
Since their introduction, torsion theories have played a key role in the study of abelian and pointed categories. In representation theory, torsion theories and lattices of torsion classes of mod$ A$, for $A$ a finite-dimensional algebra,…
Chain-of-Thought (CoT) prompting can dramatically improve the multi-step reasoning abilities of large language models (LLMs). CoT explicitly encourages the LLM to generate intermediate rationales for solving a problem, by providing a series…
In a previous paper we extended the Lorentz group to include a set of Dirac boosts that give a direct correspondence with a set of generators which for spin 1/2 systems are proportional to the Dirac matrices. The group is particularly…
We present a novel approach for teaching logic and the metatheory of logic to students who have some experience with functional programming. We define concepts in logic as a series of functional programs in the language of the proof…
Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a new theory required for each variation of the language or of…
We redefine a multiplicative group structure on the set of equivalence classes of rational sequences satisfying a fixed linear recurrence of degree two, which was defined by R. R. Laxton in his paper "On groups of linear recurrences I"…
A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.
This thesis explores how concepts of formal language theory can be used to study left-orderable groups. It analyses the languages formed by their positive cones and demonstrates how the abstract families of languages (AFLs) in the Chomsky…
We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…
Charles Peirce develops a scheme for classifying different kinds of monadic, dyadic and triadic relations. His account of these different classes of relations figures prominently in the development of his algebraic and diagrammatic systems…
These lectures provide an introduction to lattice methods for nonperturbative studies of Quantum Chromodynamics. Lecture 1 (Ch. 2): Basic techniques for QCD and results for hadron spectroscopy using the simplest discretizations; lecture 2…
We study improper mixtures from a quantum logical and geometrical point of view. Taking into account the fact that improper mixtures do not admit an ignorance interpretation and must be considered as states in their own right, we do not…
The formal construction of the second-order logic or predicate calculus essentially adds quantifiers to propositional logic. Why second-order logic cannot be reduced to that of the first order? How to demonstrate that certain predicates are…
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…
This paper seeks to apply categorical logic to the design of artificial intelligent agents that reason symbolically about objects more richly structured than sets. Using Johnstone's sequent calculus of terms- and formulae-in-context, we…
Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…