Related papers: On the Strength of Uniqueness Quantification in Pr…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
In [3], the authors proved that uniqueness holds among solutions whose exponentials are $L^p$ with $p$ bigger than a constant $\gamma$ ($p\textgreater{}\gamma$). In this paper, we consider the critical case: $p=\gamma$. We prove that the…
According to Russell, strict uses of the definite article 'the' in a definite description 'the F' involve uniqueness; in case there is more than one F, 'the F' is used somewhat loosely, and an indefinite description 'an F' should be…
The existence and multiplicity of positive periodic solutions for first non-autonomous singular systems are established with superlinearity or sublinearity assumptions at infinity for an appropriately chosen parameter. The proof of our…
Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that…
The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…
We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…
In quantum physics, recent investigations deal with the so-called "quantum trajectory" theory. Heuristic rules are usually used to give rise to "stochastic Schrodinger equations" which are stochastic differential equations of non-usual type…
Argumentation theory is a powerful paradigm that formalizes a type of commonsense reasoning that aims to simulate the human ability to resolve a specific problem in an intelligent manner. A classical argumentation process takes into account…
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…
Codd's rule of entity integrity stipulates that every table has a primary key. Hence, the attributes of the primary key carry unique and complete value combinations. In practice, data cannot always meet such requirements. Previous work…
The constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP_or), correspond naturally to the model checking problem for three increasingly stronger fragments of positive…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
We study the uniqueness of solutions to a class of heat equations with positive density posed on infinite weighted graphs. We separately consider the case when the density is bounded from below by a positive constant and the case of…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
The paper provides a uniqueness result for positive solutions of the Neumann and periodic boundary value problems associated with the $\phi$-Laplacian equation \begin{equation*} \bigl{(} \phi(u') \bigr{)}' + a(t) g(u) = 0, \end{equation*}…
We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of…
A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…