Related papers: Nested-set inconsistency
We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.
This note being devoted to some aspects of the inverse problem of representation theory contains a new insight into it illustrated by two topics. The attention is concentrated on the manner of representation of abstract objects by the…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
In this letter, by regarding finite-time stability as an inverse problem, we reveal the essence of finite-time stability and fixed-time stability. Some necessary and sufficient conditions are given. As application, we give a new approach…
We discuss the possibility of making the {\it initial} definitions of mutually different (possibly interacting, or even entangled) systems in the context of decoherence theory. We point out relativity of the concept of elementary physical…
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.…
This paper has been withdrawn due to a crucial error in the proof of the main theorem
Several examples are used to illustrate how we deal cavalierly with infinities and unphysical systems in physics. Upon examining these examples in the context of infinities from Cantor's theory of transfinite numbers, the only known…
In the paper it is demonstrated that Bells theorem is an unprovable theorem.
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
Sequential dichotomies of general delay equations are not uniform, which was proved two decades ago. This however reminds whether the countably infinite many dichotomies of a neutral equation have the sequential uniformity. In this paper,…
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…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
The stable set associated to a given set S of nonerasing endomorphisms or substitutions is the set of all right infinite words that can be indefinitely desubstituted over S. This notion generalizes the notion of sets of fixed points of…
The purpose of this paper is to provide a historical overview of some of the contemporary infinitesimalist alternatives to the Cantor-Dedekind theory of continua. Among the theories we will consider are those that emerge from nonstandard…
Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
The concept of additive basis has been investigated in the literature for several mathematicians which works with number theorem. Recently, the concept of finitely stable additive basis was introduced. In this note we provide a…