Related papers: Scott's problem for proper Scott sets
We show that any stack $\mathfrak{X}$ of finite type over a Noetherian scheme has a presentation $X \rightarrow \mathfrak{X}$ by a scheme of finite type such that $X(F) \rightarrow \mathfrak{X}(F)$ is onto, for every finite or real closed…
This is part I of a study on cardinals that are characterizable by Scott sentences. Building on [3], [6] and [1] we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if…
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…
Boundary problem for linear partial differential algebraic equations system with multiple characteristic curves is considered. It is supposed that matrix-functions pencil of the system under consideration is smoothly equivalent to special…
We give effective versions of some results on Scott sentences. We show that if $\mathcal{A}$ has a computable $\Pi_\alpha$ Scott sentence, then the orbits of all tuples are defined by formulas that are computable $\Sigma_\beta$ for some…
We prove that an algebraic stack with affine stabilizers over an arbitrary base is \'etale-locally a quotient stack around any point with a linearly reductive stabilizer. This generalizes earlier work by the authors of this article (stacks…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…
We study the representation of systems S of linear equations over the two-element field (aka xor- or parity-constraints) via conjunctive normal forms F (boolean clause-sets). First we consider the problem of finding an "arc-consistent"…
If we apply an extension of the Deduction meta-Theorem to Goedel's meta-reasoning of "undecidability", we can conclude that Goedel's formal system of Arithmetic is not omega-consistent. If we then take the standard interpretation…
We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity properties while preserving the succinctness of nondeterministic…
We prove that every quasi-Hopfian finitely presented structure $A$ has a $d$-$\Sigma_2$ Scott sentence, and that if in addition $A$ is computable and $Aut(A)$ satisfies a natural computable condition, then $A$ has a computable…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
We determine a considerable class of nonlinear partial differential equation systems which have global regular solutions. Uniqueness is not a direct general consequence of this method. The scheme can be applied to the incompressible Navier…
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…
We prove that every algebraic stack, locally of finite type over an algebraically closed field with affine stabilizers, is \'etale-locally a quotient stack in a neighborhood of a point with a linearly reductive stabilizer group. The proof…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…