相关论文: Universal (and Existential) Nulls
As one step in a working program initiated by Pudl\'ak [Pud17] we construct an oracle relative to which $\mathrm{P}\ne\mathrm{NP}$ and all non-empty sets in $\mathrm{NP}\cup\mathrm{coNP}$ have $\mathrm{P}$-optimal proof systems.
In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…
We consider the possibility of a past and future eternal universe, constructing geodesically complete inflating, loitering, and bouncing spacetimes. We identify the constraints energy conditions in General Relativity place on the building…
Based on a closed formula for a star product of Wick type on $\CP^n$, which has been discovered in an earlier article of the authors, we explicitly construct a subalgebra of the formal star-algebra (with coefficients contained in the…
An exponential interaction is constructed so that one-dimensional atoms and chains of atoms mimic the general behavior of their three-dimensional counterparts. Relative to the more commonly used soft-Coulomb interaction, the exponential…
This paper presents analogous results of Hua [7][8] on numbers of representations of quivers over finite fields which respect nilpotent relations under certain assumptions. A closed formula which counts isomorphism classes of absolutely…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer linear programs with exponential terms $2^x$ and remainder terms…
A crucial goal of quantum information is to find new ways to exploit the properties of quantum devices as resources. One of the prominent properties of quantum devices of particular interest is their negativity in quasi-probability…
In our previous arXiv papers (more systematically the informational conception is presented in the paper "The Information as Absolute", 2010) it was rigorously shown that Matter in our Universe - and Universe as a whole - are some…
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…
An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…
Some systems of nonlinear wave equations admit global solutions for all sufficiently small initial data, while others do not. The (classical) null condition guarantees that such a result holds, but it is too strong to capture certain…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…
A bilinear form on a possibly graded vector space $V$ defines a graded Poisson structure on its graded symmetric algebra together with a star product quantizing it. This gives a model for the Weyl algebra in an algebraic framework, only…
We provide a summary of several parametrisations for the nuclear equation of state that have been proposed over the past decades and list viable ranges for their parameters. Based on these parametrisations, we construct a large database of…