Related papers: Procedures of Leibnizian infinitesimal calculus: A…
On metric spaces equipped with doubling measures, we prove that a differentiability theorem holds for Lipschitz functions if and only if the space supports nontrivial (metric) derivations in the sense of Weaver that satisfy an additional…
In the last years, there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to…
We consider a one-dimensional lattice system of unbounded, real-valued spins with arbitrary strong, quadratic, finite-range interaction. We show that the canonical ensemble (ce) satisfies a uniform logarithmic Sobolev inequality (LSI). The…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
Linear Temporal Logic over finite traces ($\text{LTL}_f$) is a widely used formalism with applications in AI, process mining, model checking, and more. The primary reasoning task for $\text{LTL}_f$ is satisfiability checking; yet, the…
We establish or refute the optimality of inexact second-order methods for unconstrained nonconvex optimization from the point of view of worst-case evaluation complexity, improving and generalizing the results of Cartis, Gould and Toint…
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…
In this paper we extend a decision procedure for the Boolean algebra of finite sets with cardinality constraints ($\mathcal{L}_{\lvert\cdot\rvert}$) to a decision procedure for $\mathcal{L}_{\lvert\cdot\rvert}$ extended with set terms…
We propose an inexact proximal augmented Lagrangian framework with explicit inner problem termination rule for composite convex optimization problems. We consider arbitrary linearly convergent inner solver including in particular stochastic…
The task of inferring logical formulas from examples has garnered significant attention as a means to assist engineers in creating formal specifications used in the design, synthesis, and verification of computing systems. Among various…
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…
The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…
In their account of theory change in logic, Aberdein and Read distinguish 'glorious' from 'inglorious' revolutions--only the former preserves all 'the key components of a theory' [1]. A widespread view, expressed in these terms, is that…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part is less than the whole' introduced by Ancient Greeks and applied to all…
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
We provide choiceless proofs using infinitesimals of the global versions of Peano's existence theorem and Osgood's theorem on maximal solutions. We characterize all solutions in terms of infinitesimal perturbations. Our proofs are more…
We prove metric differentiation for differentiability spaces in the sense of Cheeger. As corollaries we give a new proof that the minimal generalized upper gradient coincides with the pointwise Lipschitz constant for Lipschitz functions on…
Scott's information systems provide a categorically equivalent, intensional description of Scott domains and continuous functions. Following a well established pattern in denotational semantics, we define a linear version of information…
By using variational methods, the existence of infinitely many solutions for a nonlinear algebraic system with a parameter is established in presence of a perturbed Lipschitz term. Our goal was achieved requiring an appropriate behavior of…