1,976 research outputs found
Formalizing Termination Proofs under Polynomial Quasi-interpretations
Usual termination proofs for a functional program require to check all the
possible reduction paths. Due to an exponential gap between the height and size
of such the reduction tree, no naive formalization of termination proofs yields
a connection to the polynomial complexity of the given program. We solve this
problem employing the notion of minimal function graph, a set of pairs of a
term and its normal form, which is defined as the least fixed point of a
monotone operator. We show that termination proofs for programs reducing under
lexicographic path orders (LPOs for short) and polynomially quasi-interpretable
can be optimally performed in a weak fragment of Peano arithmetic. This yields
an alternative proof of the fact that every function computed by an
LPO-terminating, polynomially quasi-interpretable program is computable in
polynomial space. The formalization is indeed optimal since every
polynomial-space computable function can be computed by such a program. The
crucial observation is that inductive definitions of minimal function graphs
under LPO-terminating programs can be approximated with transfinite induction
along LPOs.Comment: In Proceedings FICS 2015, arXiv:1509.0282
Quasipolynomial size frege proofs of Frankl's Theorem on the trace of sets
We extend results of Bonet, Buss and Pitassi on Bondy's Theorem and of Nozaki, Arai and Arai on Bollobas' Theorem by proving that Frankl's Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parameter t, we prove that Frankl's Theorem has polynomial size AC(0)-Frege proofs from instances of the pigeonhole principle.Peer ReviewedPostprint (author's final draft
Filling cages: reverse mathematics and combinatorial principles
Nella tesi sono analizzati alcuni principi di combinatorica dal punto di vista della reverse mathematics. La reverse mathematics \ue8 un programma di ricerca avviato negli anni settanta e interessato a individuare l'esatta forza, intesa come assiomi riguardanti l'esistenza di insiemi, di teoremi della matematica ordinaria. ---
Dopo una concisa introduzione al tema, \ue8 presentato un algoritmo incrementale per reorientare transitivamente grafi orientati infiniti e pseudo-transitivi. L'esistenza di tale algoritmo implica che un teorema di Ghouila-Houri \ue8 dimostrabile in RCA0. ---
Grafi e ordini a intervalli sono la comune tematica della seconda parte della tesi. Un primo capitolo \ue8 dedicato all'analisi di diverse caratterizzazioni di grafi numerabili a intervalli e allo studio della relazione tra grafi numerabili a intervalli e ordini numerabili a intervalli. In questo contesto emerge il tema dell'ordinabilit\ue0 unica di grafi a intervalli, a cui \ue8 dedicato il capitolo successivo. L'ultimo capitolo di questa parte riguarda invece enunciati relativi alla dimensione degli ordini numerabili a intervalli. ---
La terza parte ruota attorno due enunciati dimostrati da Rival e Sands in un articolo del 1980. Il primo teorema afferma che ogni grafo infinito contiene un sottografo infinito tale che ogni vertice del grafo \ue8 adiacente ad al pi\uf9 uno o a infiniti vertici del sottografo. Si dimostra che questo enunciato \ue8 equivalente ad ACA0, dunque pi\uf9 forte rispetto al teorema di Ramsey per coppie, nonostante la somiglianza dei due principi. Il secondo teorema dimostrato da Rival e Sands asserisce che ogni ordine parziale infinito con larghezza finita contiene una catena infinita tale che ogni punto dell'ordine \ue8 comparabile con nessuno o con infiniti elementi della catena. Quest'ultimo enunciato ristretto a ordini di larghezza k, per ogni k maggiore o uguale a tre, \ue8 dimostrato equivalente ad ADS. Ulteriori enunciati sono studiati nella tesi.In the thesis some combinatorial statements are analysed from the reverse mathematics point of view. Reverse mathematics is a research program, which dates back to the Seventies, interested to find the exact strength, measured in terms of set-existence axioms, of theorems from ordinary non set-theoretic mathematics. ---
After a brief introduction to the subject, an on-line (incremental) algorithm to transitivelly reorient infinite pseudo-transitive oriented graphs is defined. This implies that a theorem of Ghouila-Houri is provable in RCA0 and hence is computably true. ---
Interval graphs and interval orders are the common theme of the second part of the thesis. A chapter is devoted to analyse the relative strength of different characterisations of countable interval graphs and to study the interplay between countable interval graphs and countable interval orders. In this context arises the theme of unique orderability of interval graphs, which is studied in the following chapter. The last chapter about interval orders inspects the strength of some statements involving the dimension of countable interval orders. ---
The third part is devoted to the analysis of two theorems proved by Rival and Sands in 1980. The first principle states that each infinite graph contains an infinite subgraph such that each vertex of the graph is adjacent either to none, or to one or to infinitely many vertices of the subgraph. This statement, restricted to countable graphs, is proved to be equivalent to ACA0 and hence to be stronger than Ramsey's theorem for pairs, despite the similarity of the two principles. The second theorem proved by Rival and Sands states that each infinite partial order with finite width contains an infinite chain such that each point of the poset is comparable either to none or to infinitely many points of the chain. For each k greater or equal to three, the latter principle restricted to countable poset of width k is proved to be equivalent to ADS. Some complementary results are presented in the thesis
On the logical complexity of cyclic arithmetic
We study the logical complexity of proofs in cyclic arithmetic
(), as introduced in Simpson '17, in terms of quantifier
alternations of formulae occurring. Writing for (the logical
consequences of) cyclic proofs containing only formulae, our main
result is that and prove the same
theorems, for all . Furthermore, due to the 'uniformity' of our
method, we also show that and Peano Arithmetic ()
proofs of the same theorem differ only exponentially in size.
The inclusion is obtained by proof
theoretic techniques, relying on normal forms and structural manipulations of
proofs. It improves upon the natural result that is
contained in . The converse inclusion, , is obtained by calibrating the approach of Simpson '17 with
recent results on the reverse mathematics of B\"uchi's theorem in
Ko{\l}odziejczyk, Michalewski, Pradic & Skrzypczak '16 (KMPS'16), and
specialising to the case of cyclic proofs. These results improve upon the
bounds on proof complexity and logical complexity implicit in Simpson '17 and
also an alternative approach due to Berardi & Tatsuta '17.
The uniformity of our method also allows us to recover a metamathematical
account of fragments of ; in particular we show that, for , the consistency of is provable in but not
. As a result, we show that certain versions of McNaughton's
theorem (the determinisation of -word automata) are not provable in
, partially resolving an open problem from KMPS '16
Short proofs of the Kneser-Lovász coloring principle
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs for all fixed values of k.
We present a new counting-based combinatorial proof of the K neser–Lovász theorem based on the Hilton–Milner theorem; this avoids the topological arguments of prior proofs for all but finitely many base cases. We introduce new “truncated Tucker lemma” principles, which are miniaturizations of the octahedral Tucker lemma. The truncated Tucker lemma implies the Kneser–Lovász theorem. We show that the
k=1 case of the truncated Tucker lemma has polynomial size extended Frege proofs.Peer ReviewedPostprint (author's final draft
Abstracts of Ph.D. theses in mathematics
summary:Čihák, Michael: Teaching probability at secondary schools using computers.
PavlĂková, Pavla: Life and work of Miloš Kössler.
Bárta, Tomáš: Integrodifferential equations in Banach spaces
Beneš, Michal: Asymptotic behavior of the regular orbits of strongly continuous semigroup
Pavlica, David: On convex functions, dc-functions and boundary structure of convex sets.
Henclová, Alena: Duality in multistage stochastic programming and its application to arbitrage theory.
PolĂvka, Jan: Stochastic programming approach to asset-liability management.
Rychtář, Jan: Some problems in rotund renormings of Banach spaces and in operator theory.
Jeřábek, Emil: Weak pigeonehole principle and randomized computation.
Kupčáková, Marie: Geometry as creation.
Kundrátová, KarolĂna: Comparative analysis of geometric software packages based on solving selected problems.
BejÄŤek, Michal: Numerical methods for solving compressible flow problems.
Ernestová, Martina: Systems of algebraic equations and their solution in antiquity and the middle ages.
PĹ™Ăhoda, Pavel: Decompositions of modules.
JarolĂmková, Tereza: Valuation of life insurance using diffusion model of interest rate.
Fajfrová, Lucie: Equilibrium behaviour of zero range processes on binary tree.
Marek, Tomáš: Random coefficient moving average models
- …