Related papers: Incomplete Descriptions and Qualified Definiteness
A class of negative definite kernels is defined in terms of measure spaces. Using this concept, property (T) for a countable group $\G$ is characterized in terms of measure preserving actions of $\G$, as follows. If a set $S$ is translated…
This paper surveys basic properties of finite presentation in groups, Lie algebras and rings. It includes some new results and also new, more elementary proofs, of some results that are already in the literature. In particular, we discuss…
Goedel's explicit thesis was that his undecidable formula GUS is a well-formed, well-defined formal sentence in any formalisation of Intuitive Arithmetic IA in which the axioms and rules of inference are recursively definable. His implicit…
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
Large Language Models increasingly rely on self-explanations, such as chain of thought reasoning, to improve performance on multi step question answering. While these explanations enhance accuracy, they are often verbose and costly to…
We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…
Concise granule descriptions for definable granules and approaching descriptions for indefinable granules are challenging and important issues in granular computing. The concept with only common attributes has been intensively studied. To…
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…
Let $\psi$ and $F$ be positive definite forms with integral coefficients of equal degree. Using the circle method, we establish an asymptotic formula for the number of identical representations of $\psi$ by $F$, provided $\psi$ is…
For any subset $Z \subseteq \mathbb{Q}$, consider the set $S_Z$ of subfields $L\subseteq \overline{\mathbb{Q}}$ which contain a co-infinite subset $C \subseteq L$ that is universally definable in $L$ such that $C \cap \mathbb{Q}=Z$. Placing…
A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…
We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the…
In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…
Inspired by the intrinsic formality of graded algebras, we prove a necessary and sufficient condition for strongly uniqueness of DG-enhancements. This approach offers a generalization to linearity over any commutative ring. In particular,…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…
Many mathematical statements have the following form. If something is true for all finite subsets of an infinite set $I$, then it is true for all of $I$. This paper describes some old and new results on infinite sets of linear and…
Let $\mathcal{F}=(F;+,\cdot,0,1,D)$ be a differentially closed field. We consider the question of definability of the derivation $D$ in reducts of $\mathcal{F}$ of the form $\mathcal{F}_{R}=(F;+,\cdot,0,1,P)_{P \in R}$ where $R$ is a…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…