New relations and separations of conjectures about incompleteness in the fnite domain

04/02/2019
by   Erfan Khaniki, et al.
0

Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in pu18. 2. We investigate the existence of p-optimal proof systems for TAUT, assuming the collapse of C and N C (the nondeterministic version of C) for some new classes C and also prove new conditional independence results for strong theories, assuming nonexistence of p-optimal proof systems. 3. We construct two new oracles V and W. These two oracles imply several new separations of proof complexity conjectures in relativized worlds. Among them, we prove that existence of a p-optimal proof system for TAUT and existence of a complete problem for TFNP are independent of each other in relativized worlds which was not known before.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2019

New relations and separations of conjectures about incompleteness in the finite domain

Our main results are in the following three sections: 1. We prove new ...
research
04/05/2018

A Proof of the Compositions of Time Interval Relations

We prove the 169 compositions of time interval relations. The proof is f...
research
04/28/2023

Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP

We study the existence of optimal and p-optimal proof systems for classe...
research
08/10/2021

Classification of 3 mod 5 arcs in PG(3,5)

The proof of the non-existence of Griesmer [104, 4, 82]_5-codes is just ...
research
08/24/2022

On the existence of strong proof complexity generators

The working conjecture from K'04 that there is a proof complexity genera...
research
07/01/2019

On Rudimentarity, Primitive Recursivity and Representability

It is quite well-known from Kurt Gödel's (1931) ground-breaking result o...
research
06/27/2022

Hardness of almost embedding simplicial complexes in ℝ^d, II

A map f: K →ℝ^d of a simplicial complex is an almost embedding if f(σ) ∩...

Please sign up or login with your details

Forgot password? Click here to reset