Related papers: Conservation theorems on semi-classical arithmetic

We present analytic computational tools that permit us to identify, in an automatic way, conservation laws in optimal control. The central result we use is the famous Noether's theorem, a classical theory developed by Emmy Noether in 1918,…

This work extends the Ibragimov's conservation theorem for partial differential equations [{\it J. Math. Anal. Appl. 333 (2007 311-328}] to under determined systems of differential equations. The concepts of adjoint equation and formal…

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and results, it also provides sketches of various proofs and simplified presentations of certain abstract results of…

In [10], the authors formalized the standard transformation procedure for prenex normalization of first-order formulas and showed that the classes $\mathrm{E}_k$ and $\mathrm{U}_k$ introduced in Akama et al. [1] are exactly the classes…

We provide a symplectic reduction of a partially integrable Hamiltonian system to a completely integrable one. The KAM theorem is applied to this reduced completely integrable Hamiltonian system. Its KAM perturbation generates a…

We obtain the optimal system's generating operators associated with the kind generalization of the Levinson Smith equation. Using those operators we characterize all invariant solutions associated with this equation. Moreover, we present…

We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…

Preservation theorems provide a direct correspondence between the syntactic structure of first-order sentences and the closure properties of their respective classes of models. A line of work has explored preservation theorems relativised…

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

We introduce a Combinatorial Hopf Algebra (CHA) with bases indexed by the partition diagrams indexing the bases for partition algebras. By analogy with the operation $H_{\alpha} H_{\beta} = H_{\alpha \cdot \beta}$ for the complete…

We establish a version of the first Noether Theorem, according to which the (equivalence classes of) conserved quantities of given Euler-Lagrange equations in several independent variables are in one-to-one correspondence with the…

Using the recent formulation of Noether's theorem for the problems of the calculus of variations with fractional derivatives, the Lagrange multiplier technique, and the fractional Euler-Lagrange equations, we prove a Noether-like theorem to…

For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the…

We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language,…

It is generally accepted that the incompleteness of first-order number theory (PA) is established by an application of Godel's proof. This paper shows that the arithmetization of the syntax of PA implies that the hypothesised class of PA…

When the Canonical Ramsey's Theorem by Erd\H{o}s and Rado is applied to regressive functions one obtains the Regressive Ramsey's Theorem by Kanamori and McAloon. Taylor proved a "canonical" version of Hindman's Theorem, analogous to the…

Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, can both be interpreted in Zermelo-Fraenkel Set Theory, ZF;…

We prove several preservation theorems for NATP and furnish several examples of NATP. First, we prove preservation of NATP for the parametrization and sum of the theories of Fra\"{i}ss\'{e} limits of Fra\"{i}ss\'{e} classes satisfying…

Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…