Related papers: Refinements of provability and consistency princip…
We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…
This paper studies the modal logical aspects of provability predicates and consistency statements for theories of arithmetic. First, we provide an overview of previous works on the correspondence between various derivability conditions for…
A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform…
We discuss two variations of Edwards' duality theorem. More precisely, we prove one version of the theorem for cones not necessarily containing all constant functions. In particular, we allow the functions in the cone to have a non-empty…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…
In this work, we prove the existence of solutions for a tripled system of integral equations using some new results of fixed point theory associated with measure of noncompactness. These results extend some previous works in the literature,…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
Non-compact proofs are a class of reasoning that is used in mathematics but overlooked in the analysis of (un)provability of consistency. We focus on proofs of arithmetical statements (*) "for any natural number n, F(n)." A proof of (*) is…
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain…
In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…
Economic models may exhibit incompleteness depending on whether or not they admit certain policy-relevant features such as strategic interaction, self-selection, or state dependence. We develop a novel test of model incompleteness and…
The last decade has seen a remarkable development in the theory of asymptotics of Bayesian nonparametric procedures. Exponential consistency has played an important role in this area. It is known that the condition of $f_0$ being in the…
In this paper, we establish the well-posedness of Cauchy problems for weak solutions to second-order degenerate parabolic equations with a non-smooth, time-dependent degenerate elliptic part that includes both bounded and unbounded…
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…
A more detailed derivation of the Heisenberg uncertainty principle from the certainty principle is given.
This paper explains why internal and external validity cannot be simultaneously maximised. It introduces "evidential states" to represent the information available for causal inference and shows that routine study operations (restriction,…