Related papers: A limitation on the KPT interpolation

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

We refine results of Gannon [G21, Theorem 4.7] and Simon [S15a, Lemma 2.8] on equivalences of convergent Morley sequences. We then introduce the notion of eventual $NIP$, as a property of a model, and give a variant of [KP18, Corollary…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Verification methods based on SAT, SMT, and Theorem Proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal…

We give an alternative proof of the existence of the anticanonical minimal model program for potentially klt pairs, assuming the anticanonical divisor admits a birational Zariski decomposition. Moreover, we establish a structure theorem…

This paper has been withdrawn by the author becouse the conjecture presented in this paper is false. The correct study of metrics in interpolation spaces for and applcation to nonharmonic Fourier series will be published in S.Petersburg…

An explanation for the so-called constrained hierarhies is presented by linking them with the symmetries of the KP hierarchy. While the existence of ordinary symmetries (belonging to the hierarchy) allows one to reduce the KP hierarchy to…

In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…

We use the core model for sequences of measures to prove a new lower bound for the consistency strength of the failure of the SCH: THEOREM (i) If there is a singular strong limit cardinal $\kappa$ such that $2^\kappa > kappa^+$ then there…

We provide a rigorous proof of the CPT theorem within the framework of 'Lagrangian' quantum field theory. This is in contrast to the usual rigorous proofs in purely axiomatic frameworks, and non-rigorous proof-sketches within the Lagrangian…

We provide sharp lower bounds for two versions of the Kirby-Thompson invariants for knotted surfaces, one of which was originally defined by Blair, Campisi, Taylor, and Tomova. The second version introduced in this paper measures distances…

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

While syntactic inference restrictions don't play an important role for SAT, they are an essential reasoning technique for more expressive logics, such as first-order logic, or fragments thereof. In particular, they can result in short…

Information transfer in generalized probabilistic theories (GPT) is an important problem. We have dealt with the problem based on repeatability postulate, which generalizes Zurek's result to the GPT framework [Phys. Lett. A \textbf{379}…

In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…

We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…

For the sake of reliability, the kernels of Interactive Theorem Provers (ITPs) are generally kept relatively small. On top of the kernel, additional symbols and inference rules are defined. This paper presents an analysis of how kernel…

This paper investigates symmetric composite binary quantum hypothesis testing (QHT), where the goal is to determine which of two uncertainty sets contains an unknown quantum state. While asymptotic error exponents for this problem are…

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…