Limits of structures and Total NP Search Problems

01/31/2023
by   Ondřej Ježil, et al.
0

For a class of finite graphs, we define a limit object relative to some computationally restricted class of functions. The properties of the limit object then reflect how a computationally restricted viewer "sees" a generic instance from the class. The construction uses Krajíček's forcing with random variables [7]. We prove sufficient conditions for universal and existential sentences to be valid in the limit, provide several examples, and prove that such a limit object can then be expanded to a model of weak arithmetic. We then take the limit of all finite pointed paths to obtain a model of arithmetic where the problem OntoWeakPigeon is total but Leaf (the complete problem for PPA) is not. This can be viewed as a logical separation of the oracle classes of total NP search problems, which in our setting implies standard nonreducibility of Leaf to OntoWeakPigeon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/27/2018

Approximate counting and NP search problems

We study a new class of NP search problems, those which can be proved to...
research
02/05/2018

A Galois connection between Turing jumps and limits

Limit computable functions can be characterized by Turing jumps on the i...
research
04/13/2021

Limit theorems for quasi-arithmetic means of random variables with applications to point estimations for the Cauchy distribution

We establish some limit theorems for quasi-arithmetic means of random va...
research
04/01/2023

P≠NP relative to a P-complete oracle

The P versus NP problem is still unsolved. But there are several oracles...
research
04/29/2021

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses

We present initial limit Datalog, a new extensible class of constrained ...
research
05/19/2020

Proving P!=NP in first-order PA

We show that it is provable in PA that there is an arithmetically defina...
research
03/21/2022

Oracle with P=NP∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP

We construct an oracle relative to which P = NP∩coNP, but there are no m...

Please sign up or login with your details

Forgot password? Click here to reset