3,797 research outputs found
Recursion induction principle revisited
Disponible dans les fichiers attachés au documen
Perspectives for proof unwinding by programming languages techniques
In this chapter, we propose some future directions of work, potentially
beneficial to Mathematics and its foundations, based on the recent import of
methodology from the theory of programming languages into proof theory. This
scientific essay, written for the audience of proof theorists as well as the
working mathematician, is not a survey of the field, but rather a personal view
of the author who hopes that it may inspire future and fellow researchers
On tiered small jump operators
Predicative analysis of recursion schema is a method to characterize
complexity classes like the class FPTIME of polynomial time computable
functions. This analysis comes from the works of Bellantoni and Cook, and
Leivant by data tiering. Here, we refine predicative analysis by using a
ramified Ackermann's construction of a non-primitive recursive function. We
obtain a hierarchy of functions which characterizes exactly functions, which
are computed in O(n^k) time over register machine model of computation. For
this, we introduce a strict ramification principle. Then, we show how to
diagonalize in order to obtain an exponential function and to jump outside
deterministic polynomial time. Lastly, we suggest a dependent typed
lambda-calculus to represent this construction
Polynomial Path Orders: A Maximal Model
This paper is concerned with the automated complexity analysis of term
rewrite systems (TRSs for short) and the ramification of these in implicit
computational complexity theory (ICC for short). We introduce a novel path
order with multiset status, the polynomial path order POP*. Essentially relying
on the principle of predicative recursion as proposed by Bellantoni and Cook,
its distinct feature is the tight control of resources on compatible TRSs: The
(innermost) runtime complexity of compatible TRSs is polynomially bounded. We
have implemented the technique, as underpinned by our experimental evidence our
approach to the automated runtime complexity analysis is not only feasible, but
compared to existing methods incredibly fast. As an application in the context
of ICC we provide an order-theoretic characterisation of the polytime
computable functions. To be precise, the polytime computable functions are
exactly the functions computable by an orthogonal constructor TRS compatible
with POP*
Dialectica Interpretation with Marked Counterexamples
Goedel's functional "Dialectica" interpretation can be used to extract
functional programs from non-constructive proofs in arithmetic by employing two
sorts of higher-order witnessing terms: positive realisers and negative
counterexamples. In the original interpretation decidability of atoms is
required to compute the correct counterexample from a set of candidates. When
combined with recursion, this choice needs to be made for every step in the
extracted program, however, in some special cases the decision on negative
witnesses can be calculated only once. We present a variant of the
interpretation in which the time complexity of extracted programs can be
improved by marking the chosen witness and thus avoiding recomputation. The
achieved effect is similar to using an abortive control operator to interpret
computational content of non-constructive principles.Comment: In Proceedings CL&C 2010, arXiv:1101.520
Essential Incompleteness of Arithmetic Verified by Coq
A constructive proof of the Goedel-Rosser incompleteness theorem has been
completed using the Coq proof assistant. Some theory of classical first-order
logic over an arbitrary language is formalized. A development of primitive
recursive functions is given, and all primitive recursive functions are proved
to be representable in a weak axiom system. Formulas and proofs are encoded as
natural numbers, and functions operating on these codes are proved to be
primitive recursive. The weak axiom system is proved to be essentially
incomplete. In particular, Peano arithmetic is proved to be consistent in Coq's
type theory and therefore is incomplete.Comment: This paper is part of the proceedings of the 18th International
Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005). For the
associated Coq source files see the TeX sources, or see
<http://r6.ca/Goedel20050512.tar.gz
Topological recursion for monotone orbifold Hurwitz numbers: a proof of the Do-Karev conjecture
We prove the conjecture of Do and Karev that the monotone orbifold Hurwitz
numbers satisfy the Chekhov-Eynard-Orantin topological recursion.Comment: 11 pages. V2: Updated grant acknowledgments of A.P. and mail address
of R.
Infinitely many local higher symmetries without recursion operator or master symmetry: integrability of the Foursov--Burgers system revisited
We consider the Burgers-type system studied by Foursov, w_t &=& w_{xx} + 8 w
w_x + (2-4\alpha)z z_x, z_t &=& (1-2\alpha)z_{xx} - 4\alpha z w_x +
(4-8\alpha)w z_x - (4+8\alpha)w^2 z + (-2+4\alpha)z^3, (*) for which no
recursion operator or master symmetry was known so far, and prove that the
system (*) admits infinitely many local generalized symmetries that are
constructed using a nonlocal {\em two-term} recursion relation rather than from
a recursion operator.Comment: 10 pages, LaTeX; minor changes in terminology; some references and
definitions adde
- …