English
Related papers

Related papers: Turing-Taylor expansions for arithmetic theories

200 papers

We prove that if the linear-time and polynomial-time hierarchies coincide, then every model of $\Pi_1(\mathbb{N}) + \neg \Omega_1$ has a proper end-extension to a model of $\Pi_1(\mathbb{N})$, and so $\Pi_1(\mathbb{N}) + \neg \Omega_1…

Logic · Mathematics 2014-11-26 Leszek Aleksander Kołodziejczyk

Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus. More recently, a…

Logic in Computer Science · Computer Science 2023-06-22 Farzaneh Derakhshan , Frank Pfenning

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

We propose an extension of the recently-proposed volume conjecture for closed hyperbolic 3-manifolds, to all orders in perturbative expansion. We first derive formulas for the perturbative expansion of the partition function of complex…

High Energy Physics - Theory · Physics 2018-09-14 Dongmin Gang , Mauricio Romo , Masahito Yamazaki

We provide a categorical proof of convergence for martingales and backward martingales in mean, using enriched category theory. The enrichment we use is in topological spaces, with their canonical closed monoidal structure, which encodes a…

Category Theory · Mathematics 2026-02-16 Paolo Perrone , Ruben Van Belle

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…

Logic · Mathematics 2018-01-08 Michael Rathjen

Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various purposes, notably the study of programs in the context of…

Logic in Computer Science · Computer Science 2015-07-01 Daniel M Leivant

Stochastic Taylor expansions of the expectation of functionals applied to diffusion processes which are solutions of stochastic differential equation systems are introduced. Taylor formulas w.r.t. increments of the time are presented for…

Probability · Mathematics 2013-10-24 Andreas Rößler

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…

Logic in Computer Science · Computer Science 2024-02-14 Peter Habermehl , Dietrich Kuske

Cartesian differential categories provide a categorical framework for multivariable differential calculus and also the categorical semantics of the differential $\lambda$-calculus. Taylor series expansion is an important concept for both…

Category Theory · Mathematics 2024-12-18 Jean-Simon Pacaud Lemay

We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…

Logic · Mathematics 2022-07-26 Emanuele Frittaion

We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…

Logic · Mathematics 2010-05-18 Aubrey da Cunha

We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…

Logic · Mathematics 2012-10-18 Lev D. Beklemishev , David Fernández-Duque , Joost J. Joosten

In this paper we summarize some known facts on slice topology in the quaternionic case, and we deepen some of them by proving new results and discussing some examples. We then show, following [18], how this setting allows us to generalize…

Complex Variables · Mathematics 2024-06-27 X. Dou , M. Jin , G. Ren , I. Sabadini

Feynman diagrams are the foremost tool in the perturbative study of quantum field theory. In gauge theories, the full potential of this tool is revealed when it is combined with the Slavanov-Taylor identities associated with the local gauge…

High Energy Physics - Theory · Physics 2025-12-16 Roji Pius

Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and…

Information Theory · Computer Science 2018-04-16 Hector Zenil , Liliana Badillo , Santiago Hernández-Orozco , Francisco Hernández-Quiroz

In this work we treat a famous topic in Ergodic Theory and Dynamical Systems: uniformly expanding maps. We relate regularity of expanding maps and conjugacies with Lyapunov exponents, metric and topological entropies for expanding maps of…

Dynamical Systems · Mathematics 2016-04-12 F Micena

In the recently proposed generalization of the Yang-Mills theory the group of gauge transformation gets essentially enlarged. This enlargement involves an elegant mixture of the internal and space-time symmetries. The resulting group is an…

High Energy Physics - Theory · Physics 2011-01-04 George Savvidy

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…

Logic in Computer Science · Computer Science 2011-08-24 Giorgi Japaridze

Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based proof search to higher-order logic. The prover may cooperate…

Artificial Intelligence · Computer Science 2022-12-12 Alexander Steen , Christoph Benzmüller