Unsolved Problems

Showing 1-9 of 9 problems

OPG-1790
Open

Tarski's exponential function problem

Conjecture Is the theory of the real numbers with the exponential function decidable?...

L1
Logic
OPG-2379
Open

Termination of the sixth Goodstein Sequence

Question How many steps does it take the sixth Goodstein sequence to terminate?...

L1
Logic
OPG-37424
Open

Fixed-point logic with counting

Question Can either of the following be expressed in fixed-point logic plus counting: - Given a graph, does it have a perfect matching, i.e., a set $...

L1
Logic
OPG-37429
Open

Order-invariant queries

Question - Does ${<}\text{-invariant\:FO} = \text{FO}$ hold over graphs of bounded tree-width? - Is ${<}\text{-invariant\:FO}$ included in $\text{MSO...

L1
Logic
OPG-37440
Open

Monadic second-order logic with cardinality predicates

The problem concerns the extension of Monadic Second Order Logic (over a binary relation representing the edge relation) with the following atomic for...

L1
Logic
OPG-37444
Open

Blatter-Specker Theorem for ternary relations

Let $C$ be a class of finite relational structures. We denote by $f_C(n)$ the number of structures in $C$ over the labeled set $\{0, \dots, n-1 \}$. F...

L1
Logic
OPG-37448
Open

MSO alternation hierarchy over pictures

Question Is the MSO-alternation hierarchy strict for pictures that are balanced, in the sense that the width and the length are polynomially (or linea...

L1
Logic
OPG-37863
Open

Finite entailment of Positive Horn logic

Question Positive Horn logic (pH) is the fragment of FO involving exactly $\exists, \forall, \wedge, =$. Does the fragment $pH \wedge \neg pH$ have th...

L1
Logic
OPG-38188
Open

Vertex Cover Integrality Gap

Conjecture For every $\varepsilon > 0$ there is $\delta > 0$ such that, for every large $n$, there are $n$-vertex graphs $G$ and $H$ such that $G \equ...

L1
Logic