Related papers: Deducibility in the full Lambek calculus with weak…
In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…
We study a class of weakly coupled Hamilton-Jacobi systems with a specific aim to perform a qualitative analysis in the spirit of weak KAM theory. Our main achievement is the definition of a family of related action functionals containing…
We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…
We investigate the satisfiability degree of some equations in finite BCK-algebras; that is, given a finite BCK-algebra and an equation in the language of BCK-algebras, what is the probability that elements chosen uniformly randomly with…
We give an algebraic proof of the criterion for hereditary structural completeness of an intermediate logic, or, equivalently, of the primitiveness of a variety of Heyting algebras.
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…
The equivalence between logarithmic Sobolev inequalities and hypercontractivity of solutions of Hamilton-Jacobi equations has been proved in [5]. We consider a semi-Lagrangian approximation scheme for the Hamilton-Jacobi equation and we…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
We prove the finiteness of leaps of modules of $m$-integrable derivations for algebras essentially of finite type and, more generally, for schemes essentially of finite type over an algebraically closed field of positive characteristic.…
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
We use orthogonality calculus to prove a downward transfer from categoricity in a successor in abstract elementary classes (AECs) that have a good frame (a forking-like notion for types of singletons) on an interval of cardinals:…
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…
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…
To each partition $\frak p$ of $n$ we associate in a canonical way a simple $S_n$ module with an orthogonal basis indexed by Young diagrams in a way which carries over immediately to the quantized case. With this we show that the Hecke…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
The displacement calculus $\mathbf{D}$ is a conservative extension of the Lambek calculus $\mathbf{L1}$ (with empty antecedents allowed in sequents). $\mathbf{L1}$ can be said to be the logic of concatenation, while $\mathbf{D}$ can be said…
We prove that $L^2$ weak solutions to hypoelliptic equations with bounded measurable coefficients are H\"older continuous. The proof relies on classical techniques developed by De Giorgi and Moser together with the averaging lemma and…
For W a finite (2-)reflection group and B its (generalized) braid group, we determine the Zariski closure of the image of B inside the corresponding Iwahori-Hecke algebra. The Lie algebra of this closure is reductive and generated in the…
Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…