240 problems
Let be a finite alphabet. The set of generalized regular expressions over is defined inductively: and for each are generalized regular expressions…
An abstract elementary class (AEC) is a class of structures in a fixed vocabulary with a strong-submodel relation satisfying the AEC axioms; its Löwenheim–Skolem num…
Determine the automorphism group of the partial order of Turing degrees.
For every class of finite graphs of bounded degree and every order-invariant cluster first-order logic sentence , there exists a first-order sentence …
For every -algebra , every bounded increasing net in the ordered self-adjoint part has a least upper bound in …
Select arbitrary finite order k=1, rational constant coefficients a1,...,ak and rational initial values u0,...,u(k-1), each finitely encoded in binary, with u(n+k)=sum(i=1)^k ai u(…
This entry tracks Hilbert’s tenth problem over number fields. It connects abc-type inequalities to undecidability over broad classes of number fields. Latest development The paper…
This entry tracks Craig interpolation for test-free propositional dynamic logic. It separates the interpolation behavior of full PDL from its test-free fragment and related modal l…
Determine the least integer n for which no algorithm decides whether an arbitrary integer-coefficient polynomial in at most n variables has an integer zero. Source: William Gasarch…
Determine whether Con(ZFC plus the existence of a strongly compact cardinal) implies Con(ZFC plus the existence of a supercompact cardinal), or prove that the latter has strictly g…
Determine the exact large-cardinal consistency strength of ZFC plus the Proper Forcing Axiom (PFA): identify its equiconsistency level by matching upper and lower consistency bound…
Determine whether ZFR is consistent, where ZFR is the first-order theory ZF(j) plus the assertion that a nontrivial function symbol j:V-V is Sigma1-elementary and hence fully eleme…
Assuming delta is an extendible cardinal, prove that there is an inner model N contained in HOD such that N is a weak extender model for the supercompactness of delta and N satisfi…
The question is: “What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories…
In the usual one-sorted setting of regular abstract-model-theoretic logics, ask whether there is a logic such that, for every vocabulary, it is compact, has the Beth property a…
The question, as given, is: “Is the theory of the field of Laurent series over decidable? of the field of polynomials over ?” It does not unambiguously i…
Is the Borel monadic theory of the real order (BMTO) decidable? Is the monadic theory of well-ordering (MTWO) consistently decidable? Shelah (1990) Background These questions appea…
Let be a complete first-order theory, and call a model atomic if every finite tuple from realizes a principal complete type over the empty set. Write…
Does a finitely presented homogeneous structure for a finite relational language have finitely many reducts?
Let be a countable first-order language, let be a countable -theory, and let be a countable family of parameter-free partial types, each in a finite tuple of variabl…
Work in the standard setting of a countable vocabulary and a complete first-order theory , with its class of models having the joint embedding and amalgamation properties. An em…
Let be a finite set of finite graphs. A graph is -free if it contains no subgraph isomorphic to any member of ; the forbidden subgraph need…
Let be a complete simple first-order theory in a language , and work in a monster model of . For disjoint tuples of variables , an -formula is stab…
Shelah's categoricity conjecture for : If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.
The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for -saturated models of a countable theory.