English
Related papers

Related papers: Extending valuations to formal completions

200 papers

In Formal Concept Analysis, a base for a finite structure is a set of implications that characterizes all valid implications of the structure. This notion can be adapted to the context of Description Logic, where the base consists of a set…

Logic in Computer Science · Computer Science 2022-02-22 Ricardo Guimarães , Ana Ozaki , Cosimo Persia , Baris Sertkaya

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…

High Energy Physics - Phenomenology · Physics 2009-11-10 Stefan Weinzierl

The present informal set of notes covers the material that has been presented by the author in a series of lectures for the Doctoral School in Mathematics of the Southern Federal State University of Rostov-on-Don in the Fall of 2020 and…

Functional Analysis · Mathematics 2023-12-29 Massimo Lanza de Cristoforis

This paper deals with valuations of fields of formal meromorphic functions and their residue fields. We explicitly describe the residue fields of the monomial valuations. We also classify all the discrete rank one valuations of fields of…

Commutative Algebra · Mathematics 2012-11-05 F. J. Herrera-Govantes , M. A. Olalla Acosta , J. L. Vicente-Cordoba

Suppose that $(K,v_0)$ is a valued field, $f(x)\in K[x]$ is a monic and irreducible polynomial and $(L,v)$ is an extension of valued fields, where $L=K[x]/(f(x))$. Let $A$ be a local domain with quotient field $K$ dominated by the valuation…

Commutative Algebra · Mathematics 2023-08-11 Razieh Ahmadian , Steven Dale Cutkosky

This paper shows an overview of a research project for integrating formal methods in popular practices for software development in Mexico. The article shows only the main results from the survey about methods and practices and an overview…

Software Engineering · Computer Science 2016-04-01 Carlos Alberto Fernandez-y-Fernandez

This paper is based on a course given by the author at the University of Rome ``La Sapienza'' in the Academic year 2000/2001. The intended aim of the course was to rapidly introduce, although not in an exhaustive way, the non-expert PhD…

Algebraic Geometry · Mathematics 2007-05-23 Marco Manetti

This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…

Classical Analysis and ODEs · Mathematics 2018-03-09 Silvia Licciardi

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…

Logic in Computer Science · Computer Science 2019-03-21 Michele Basaldella

This paper explores two topics at once: the use of denotational semantics to bound the evaluation length of functional programs, and the semantics of strong (that is, possibly under abstractions) call-by-value evaluation. About the first,…

Logic in Computer Science · Computer Science 2023-07-04 Beniamino Accattoli , Giulio Guerrieri , Maico Leberle

We extend to Barvinok's valuations the Euler-Maclaurin expansion formula which we obtained previously for the sum of values of a polynomial over the integral points of a rational polytope. This leads to an improvement of Barvinok's…

Combinatorics · Mathematics 2016-08-14 Velleda Baldoni , Nicole Berline , Michèle Vergne

This paper collects and extends the lectures I gave at the "XXIV International Fall Workshop on Geometry and Physics" held in Zaragoza (Spain) August 31 - September 4, 2015. Within these lectures I review the formulation of Quantum…

Mathematical Physics · Physics 2016-10-13 Valter Moretti

The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…

Logic in Computer Science · Computer Science 2023-09-26 Maria J. D. Lima , Flávio L. C. de Moura

The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal logic, and is based on the idea that Pawlak's original…

Let F be a field complete for a real valuation. It is a standard result in valuation theory that a finite extension of F admits a valuation basis if and only if it is without defect. We show that even otherwise, one can construct bases in…

Rings and Algebras · Mathematics 2007-05-23 Kiran. S. Kedlaya

We present a method derived from Laplace transform theory that enables the evaluation of fractional integrals. This method is adapted and extended in a variety of ways to demonstrate its utility in deriving alternative representations for…

Classical Analysis and ODEs · Mathematics 2009-09-25 M. Lawrence Glasser , Victor Kowalenko

Locally $L^0$-convex modules were introduced in [D. Filipovic, M. Kupper, N. Vogelpoth. Separation and duality in locally $L^0$-convex modules. J. Funct. Anal. 256(12), 3996-4029 (2009)] as the analytic basis for the study of multi-period…

Functional Analysis · Mathematics 2018-01-30 Antonio Avilés , José Miguel Zapata

We develop extensions to auction theory results that are useful in real life scenarios. 1. Since valuations are generally positive we first develop approximations using the log-normal distribution. This would be useful for many finance…

Computer Science and Game Theory · Computer Science 2019-05-09 Ravi Kashyap

A classical theorem of P. McMullen describes all valuations on polytopes that are invariant under translations and weakly continuous, i.e., continuous with respect to parallel displacements of the facets of a polytope. While it is typically…

Metric Geometry · Mathematics 2019-08-15 Thomas Wannerer

Autoformalization has emerged as a term referring to the automation of formalization - specifically, the formalization of mathematics using interactive theorem provers (proof assistants). Its rapid development has been driven by progress in…

Artificial Intelligence · Computer Science 2025-12-16 Agnieszka Mensfelt , David Tena Cucala , Santiago Franco , Angeliki Koutsoukou-Argyraki , Vince Trencsenyi , Kostas Stathis
‹ Prev 1 3 4 5 6 7 10 Next ›