Related papers: Incomplete Descriptions and Qualified Definiteness

The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves…

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…

It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…

We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a…

Circumscription is one of the main approaches for defining non-monotonic description logics (DLs). While the decidability and complexity of traditional reasoning tasks such as satisfiability of circumscribed DL knowledge bases (KBs) is well…

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…

This paper presents a formal approach to explaining change of inference in Quantitative Bipolar Argumentation Frameworks (QBAFs). When drawing conclusions from a QBAF and updating the QBAF to then again draw conclusions (and so on), our…

Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been…

For a rigid tensor abelian category $T$ over a field $k$ we introduce a notion of a normal quotient $q:T\to Q$. In case $T$ is a Tannaka category, our notion is equivalent to Milne's notion of a normal quotient. More precisely, if $T$ is…

The central focus is on clarifying the distinction between sets and proper classes. To this end we identify several categories of concepts (surveyable, definite, indefinite), and we attribute the classical set theoretic paradoxes to a…

Public, professional and academic interest in automated fact-checking has drastically increased over the past decade, with many aiming to automate one of the first steps in a fact-check procedure: the selection of so-called checkworthy…

I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…

We propose new definitions of (causal) explanation, using structural equations to model counterfactuals. The definition is based on the notion of actual cause, as defined and motivated in a companion paper. Essentially, an explanation is a…

Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them.…

Let $A$ be abelian variety over the function field $K$ of a compact Riemann surface $B$. Fix a model $f \colon \mathcal{A} \to B$ of $A/K$ and a certain effective horizontal divisor $\DD \subset \mathcal{A}$. We give a sufficient condition…

Let $k$ be a perfect field such that for every $n$ there are only finitely many field extensions, up to isomorphism, of $k$ of degree $n$. If $G$ is a reductive algebraic group defined over $k$, whose characteristic is very good for $G$,…

Often information relevant to a decision is summarized in an index number. This paper explores conditions under which conclusions using index numbers are relevant to the decision that needs to be made. Specifically it explores the idea that…

Reliable uncertainty quantification is essential for the use of machine learning in physics, where scientific discoveries depend on validated probabilistic statements. We provide a structured overview of uncertainty quantification in ML for…

Let $R$ be a commutative ring with identity. A unit $u$ of $R$ is called exceptional if $1-u$ is also a unit. When $R$ is a finite commutative ring, we determine the additive and multiplicative structures of its exceptional units; and then…