Related papers: Incomplete Descriptions and Qualified Definiteness
Description Logics (DLs) are appropriate, widely used, logics for managing structured knowledge. They allow reasoning about individuals and concepts, i.e. set of individuals with common properties. Typically, DLs are limited to dealing with…
Defining various dishonest notions in a formal way is a key step to enable intelligent agents to act in untrustworthy environments. This review evaluates the literature for this topic by looking at formal definitions based on modal logic as…
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
Let $K$ be a large field such that $K[\sqrt{-1}]$ is not algebraically closed and $F/K$ a function field in one variable. Extending techniques and results from earlier work with Becher and Dittmann, we show that every valuation ring on $F$…
We show how G\"odel's first incompleteness theorem has an analog in quantum theory. G\"odel's theorem implies endless opportunities for appending axioms to arithmetic, implicitly showing a role for an agent, namely an agent that asserts an…
Language models are increasingly being used in important decision pipelines, so ensuring the correctness of their outputs is crucial. Recent work has proposed evaluating the "factuality" of claims decomposed from a language model generation…
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…
Existing algorithms for explaining the outputs of image classifiers are based on a variety of approaches and produce explanations that frequently lack formal rigour. On the other hand, logic-based explanations are formally and rigorously…
For some images, descriptions written by multiple people are consistent with each other. But for other images, descriptions across people vary considerably. In other words, some images are specific $-$ they elicit consistent descriptions…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
In this paper, we study questions of definability and decidability for infinite algebraic extensions ${\bf K}$ of $\mathbb{F}_p(t)$ and their subrings of $\mathcal{S}$-integral functions. We focus on fields ${\bf K}$ satisfying a local…
Referring is one of the most basic and prevalent uses of language. How do speakers choose from the wealth of referring expressions at their disposal? Rational theories of language use have come under attack for decades for not being able to…
A (positive definite and integral) quadratic form $f$ is called regular if it represents all integers that are locally represented. It is known that there are only finitely many regular ternary quadratic forms up to isometry. However, there…
We present an imperative object calculus where types are annotated with qualifiers for aliasing and mutation control. There are two key novelties with respect to similar proposals. First, the type system is very expressive. Notably, it…
Examples are given of profinite groups that are not strongly complete, and have other `bad' properties, yet have only finitely many open subgroups of each finite index. It is shown that a profinite group with the latter property must be…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
Most discussions of G\"odel's theorems fall into one of two types: either they emphasize perceived philosophical, cultural "meanings" of the theorems, and perhaps sketch some of the ideas of the proofs, usually relating G\"odel's proofs to…
For a normal F-finite variety $X$ and a boundary divisor $\Delta$ we give a uniform description of an ideal which in characteristic zero yields the multiplier ideal, and in positive characteristic the test ideal of the pair $(X,\Delta)$.…
Let $G$ be a group and let $K$ be a commensurated subgroup of $G$. Then there is a totally disconnected, locally compact (t.d.l.c.) group $\hat{G}_K$ that contains the profinite completion of $K$ as an open compact subgroup and also…
An irredundant cover of a finite group $G$ is a collection of proper subgroups whose union is $G$ and which contains no smaller subcover. We classify finite groups which possess exactly two irredundant covers, thereby initiating an answer…