Related papers: Incomplete Descriptions and Qualified Definiteness
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
The aim of the paper is to give a full characterization of functions f from I into the real line R (where I is an interval in R that satisfies certain natural conditions) such that for any I-valued positive definite kernel K defined on an…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
Many kinds of categorical structure require the existence of finite limits, of colimits of some specified type, and of "exactness" conditions between the finite limits and the specified colimits. Some examples are the notions of regular, or…
Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…
An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…
In his paper on the incompleteness theorems, G\"odel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that 'direct'…
Many procedures for SAT-related problems, in particular for those requiring the complete enumeration of satisfying truth assignments, rely their efficiency and effectiveness on the detection of (possibly small) partial assignments…
These notes aim to give a gentle account to one approach to the theory of finite sets without making use of the natural numbers. They were written to be used as the basis for a student seminar. There are no real prerequisites except for a…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
In this paper we formulate the problem of inference under incomplete information in very general terms. This includes modelling the process responsible for the incompleteness, which we call the incompleteness process. We allow the process…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We fix a finitely presented group $Q$ and consider short exact sequences $1\to N\to G\to Q\to 1$ with $G$ finitely generated. The inclusion $N\to G$ induces a morphism of profinite completions $\hat N\to \hat G$. We prove that this is an…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
Since Austin introduced the term ``infelicity'', the linguistic literature has been flooded with its use, but no formal or computational explanation has been given for it. This thesis provides one for those infelicities that occur when a…
A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…