English
Related papers

Related papers: Prenex normalization and the hierarchical classifi…

200 papers

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…

Numerical Analysis · Mathematics 2016-02-19 Olivier Bokanowski , Maurizio Falcone , Smita Sahu

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

Logic in Computer Science · Computer Science 2017-03-06 Dietrich Kuske , Nicole Schweikardt

Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…

Logic · Mathematics 2025-12-09 Fedor Pakhomov , Giovanni Soldà

The problem of representing a class of maps in a form suited for application of normal form methods is revisited. It is shown that using the methods of Lie series and of Lie transform a normal form algorithm is constructed in a…

Dynamical Systems · Mathematics 2013-04-01 Antonio Giorgilli

We consider Clifford algebras with nonsymmetric bilinear forms, which are isomorphic to the standard symmetric ones, but not equal. Observing, that the content of physical theories is dependent on the injection $\oplus^n\bigwedge…

High Energy Physics - Theory · Physics 2009-10-28 Bertfried Fauser

In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…

Logic · Mathematics 2011-04-26 Zhaohua Luo

In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…

Algebraic Topology · Mathematics 2017-06-02 Ralph M. Kaufmann , Benjamin C. Ward

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

Logic · Mathematics 2023-06-22 Oleg Kudinov , Victor Selivanov

Higher Type Arithmetic (HA$^w$) is a first-order many-sorted theory. It is a conservative extension of Heyting Arithmetic obtained by extending the syntax of terms to all of System T: the objects of interest here are the functionals of…

Logic in Computer Science · Computer Science 2023-11-20 Félix Castro

Dirichlet distribution and Dirichlet process as its infinite dimensional generalization are primarily used conjugate prior of categorical and multinomial distributions in Bayesian statistics. Extensions have been proposed to broaden…

Methodology · Statistics 2014-12-05 Xuenan Feng

We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…

Category Theory · Mathematics 2024-07-08 Eric Finster , Alex Rice , Jamie Vicary

In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…

Logic · Mathematics 2026-05-12 János Balázs Ivanyos

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…

Programming Languages · Computer Science 2020-09-22 Kazuhiko Sakaguchi

A perturbative description of Large Scale Structure is a cornerstone of our understanding of the observed distribution of matter in the universe. Renormalization is an essential and defining step to make this description physical and…

High Energy Physics - Theory · Physics 2016-06-08 Ali Akbar Abolhasani , Mehrdad Mirbabayi , Enrico Pajer

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

Iterative regularization is a classic idea in regularization theory, that has recently become popular in machine learning. On the one hand, it allows to design efficient algorithms controlling at the same time numerical and statistical…

Machine Learning · Statistics 2024-10-10 Vassilis Apidopoulos , Tomaso Poggio , Lorenzo Rosasco , Silvia Villa

We study the class of 3-dimensional nonlinear 2-hessian equations mentioned in the text. We perform preliminary group classification on 2-hessian equation. In fact, we find additional equivalence transformation on the space (x,y,z,u,f),…

Differential Geometry · Mathematics 2019-02-08 Mahdieh Yourdkhany , Mehdi Nadjafikhah , Megerdich Toomanian

The Hecke category is emerging as a fundamental object in representation theory. We give a motivated introduction to this category in both its geometric (via parity sheaves) and diagrammatic (generators and relations) incarnations. We also…

Representation Theory · Mathematics 2018-01-04 Geordie Williamson

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

Symbolic Computation · Computer Science 2008-01-10 S. P. Tsarev
‹ Prev 1 8 9 10 Next ›