English
Related papers

Related papers: Procedures of Leibnizian infinitesimal calculus: A…

200 papers

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

Rings and Algebras · Mathematics 2007-05-23 U. D. Bekbaev , I. S. Rakhimov

In his remarkable paper Formalism64, Robinson defends his philsophocal position as follows: (i) Any mention of infinite totalities is literally meaningless. (ii) We should act as if infinite totalities really existed. Being the originator…

Logic · Mathematics 2017-02-06 Sam Sanders

The goal of this paper consists of developing a new (more physical and numerical in comparison with standard and non-standard analysis approaches) point of view on Calculus with functions assuming infinite and infinitesimal values. It uses…

General Mathematics · Mathematics 2012-03-20 Yaroslav D. Sergeyev

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the…

Logic · Mathematics 2010-03-23 Lucius T. Schoenbaum

The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…

Algebraic Topology · Mathematics 2024-05-31 Brice Le Grignou , Victor Roca i Lucio

The classical Riemann-Roch theorem has been extended by N. Nadirashvili and then M. Gromov and M. Shubin to computing indices of elliptic operators on compact (as well as non-compact) manifolds, when a divisor mandates a finite number of…

Spectral Theory · Mathematics 2019-10-01 Minh Kha , Peter Kuchment

We introduce the ring of Fermat reals, an extension of the real field containing nilpotent infinitesimals. The construction takes inspiration from Smooth Infinitesimal Analysis (SIA), but provides a powerful theory of actual infinitesimals…

Mathematical Physics · Physics 2015-05-14 Paolo Giordano

In a finite volume system, we prove a no-go theorem on a Leibniz rule with a care of locality argument on latttice. The new possibility on the Leibniz rule solutions on lattice is discussed. Although the new solution admits a local…

High Energy Physics - Lattice · Physics 2012-12-10 Mitsuhiro Kato , Makoto Sakamoto , Hiroto So

The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional)…

Optimization and Control · Mathematics 2011-02-11 M. J. Cánovas , M. A. LóPez , B. S. Mordukhovich , J. Parra

We study the bilinear estimates in the Sobolev spaces with the Dirichlet and the Neumann boundary condition. The optimal regularity is revealed to get such estimates in the half space case, which is related to not only smoothness of…

Analysis of PDEs · Mathematics 2019-11-27 Tsukasa Iwabuchi

A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof…

Logic in Computer Science · Computer Science 2007-08-17 Chuck Liang , Dale Miller

The aim of our paper is twofold: firstly we present a sequent calculus for an intuitionistic non-Fregean logic ISCI, which is based on the calculus presented in the paper by Chlebowski and Leszczynska-Jasion, 'An Investigation into…

Logic in Computer Science · Computer Science 2022-04-15 Agata Tomczyk , Dorota Leszczyńska-Jasion

The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz , Julian Michael

In a 2013 paper, the author showed that the convolution of a compactly supported measure on the real line with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). In a 2014 paper, the author gave bounds for the optimal…

Functional Analysis · Mathematics 2014-12-05 David Zimmermann

In the infinite-horizon and discrete-time framework we establish maximum principles of Pontryagin under assumptions which weaker than these ones of existing results. We avoid several assumptions of continuity and of…

Optimization and Control · Mathematics 2016-02-03 Joël Blot , Thoi-Nhan Ngo

I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…

Logic · Mathematics 2025-06-23 Antonio Piccolomini d'Aragona

Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…

Logic in Computer Science · Computer Science 2023-05-11 Zhibo Chen , Frank Pfenning

We propose to study proof search from a coinductive point of view. In this paper, we consider intuitionistic logic and a focused system based on Herbelin's LJT for the implicational fragment. We introduce a variant of lambda calculus with…

Logic in Computer Science · Computer Science 2013-09-05 José Espírito Santo , Ralph Matthes , Luís Pinto

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

Lower bounds against strong algebraic proof systems and specifically fragments of the Ideal Proof System (IPS), have been obtained in an ongoing line of work. All of these bounds, however, are proved only over large (or characteristic $0$)…

Computational Complexity · Computer Science 2025-06-23 Tal Elbaz , Nashlen Govindasamy , Jiaqi Lu , Iddo Tzameret
‹ Prev 1 3 4 5 6 7 10 Next ›