Related papers: Rosser provability and the second incompleteness t…

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…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and extensional completeness with respect…

Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…

In this paper, we attempt to develop the Schreier theory for two special types extensions of multiplicative Lie algebras.

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$…

Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in…

Extending the results of Nardi (2015), this note establishes an existence and uniqueness result for second-order uniformly elliptic PDEs in divergence form with Neumann boundary conditions. A Schauder estimate is also derived.

We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.

In this paper we consider the remaining cases of Hebey-Vaugon conjecture.

Here we give a short survey of our new results. References to the complete proofs can be found in the text of this article and in the litterature.

We consider the problem of rational uncertainty about unproven mathematical statements, remarked on by G\"odel and others. Using Bayesian-inspired arguments we build a normative model of fair bets under deductive uncertainty which draws…

We study Poincar\'e Duality in the context of abstract 6-functor formalisms. In particular, we give a small and simple list of assumptions that implies Poincar\'e Duality. As an application, we give new uniform (and essentially formal)…

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

Generalized uncertainty relations may depend not only on the commutator relation of two observables considered, but also on mutual correlations, in particular, on entanglement. The equivalence between the uncertainty relation and Bohr's…

In a previous paper we developed the notions of th-independence and \th-ranks which define a geometric independence relation in a class of theories which we called ``rosy''. We proved that rosy theories include simple and o-minimal theories…

We derive a priori estimates for second order derivatives of solutions to a wide calss of fully nonlinear elliptic equations on Riemannian manifolds. The equations we consider naturally appear in geometric problems and other applications…

In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…

In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…