14 problems
- 0 votes0 replies1 view
Characterization of strongly first-order families of dependencies
Characterization conjecture. A family of dependencies is strongly first order if and only if every dependency is strongly first order.
- 0 votes0 replies0 views
Łoś's categoricity conjecture
Łoś's conjecture. contains every uncountable cardinal or no uncountable cardinal.
- 0 votes0 replies0 views
The first-order-transduction characterization of bounded merge-width
For a graph class , say that it has bounded merge-width when its merge-width is bounded by a constant. A first-order transduction is an interpretation of graphs from s…
- 0 votes0 replies0 views
Conjecture on coNP-intermediate hereditary first-order model-checking problems
Let a first-order sentence define the hereditary first-order model-checking problem . A problem is coNP-intermediate if it belongs to coNP but is n…
- 0 votes0 replies0 views
The plausible extension from Nelsonian validity to classical conditionality
Let be a theory in the empty-signature first-order language, , such that … Here, is the relevant Nelsonian semantic structur…
- 0 votes0 replies0 views
The random-group theory conjecture for densities below one-half
Let , and let be a first-order sentence in the language of groups. Let be the free group of rank , and consider the density- random-gr…
- 0 votes0 replies0 views
Sublogarithmic first-order distinguishability conjecture for sparse random graphs
Sublogarithmic distinguishability conjecture. With high probability,
- 0 votes0 replies0 views
Completeness conjecture for the one-variable fragment of first-order full Lambek Calculus
Completeness conjecture. An axiomatization for the one-variable fragment of the first-order version of full Lambek Calculus should be complete for valid equations, but not for cons…
- 0 votes0 replies0 views
Quantifier-free simultaneous-induction conjecture for right cancellation of list concatenation
Let be the base theory for list concatenation, and let denote the set of open formulas in its language. Let…
- 0 votes0 replies0 views
Malliaris–Shelah's characterization of the maximal first-order theory class
Malliaris–Shelah's conjecture. The maximal class is exactly the class of SOP first-order theories.
- 0 votes0 replies0 views
Non-derivability of the constant domain axiom in D.FO with prelinearity
In the calculus, let denote the present first-order deductive framework, and let the prelinearity rule be … The two rules in are the analytic structural ru…
- 0 votes0 replies0 views
Disjunctive-binding first-order logic decidability conjecture
Disjunctive-binding decidability conjecture. The fragment enjoys a decidable satisfiability problem.
- 0 votes0 replies0 views
Conjunctive-binding first-order logic positive-properties conjecture
Conjunctive-binding positive-properties conjecture. The fragment enjoys the finite-model property and has a decidable satisfiability problem.
- 0 votes0 replies0 views
Extensions of one-binding first-order logic preserve finite-model and algorithmic properties
Extension-preservation conjecture. Some of these extensions preserve the same model-theoretic and algorithmic properties.