Related papers: Scott's problem for proper Scott sets
We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
We present an executable formally verified SAT encoding of classical AI planning. We use the theorem prover Isabelle/HOL to perform the verification. We experimentally test the verified encoding and show that it can be used for reasonably…
We prove some facts about locales $L$ equipped with the Scott topology $\Omega(L)$, in particular studying a canonical frame homomorphism $\phi:\Omega(L)\to L$ which is motivated by an application to cognitive science. Such a topological…
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
Scott's information systems provide a categorically equivalent, intensional description of Scott domains and continuous functions. Following a well established pattern in denotational semantics, we define a linear version of information…
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
We show that for a wide class of groups of finite Morley rank the presence of a split $BN$-pair of Tits rank $1$ forces the group to be of the form $\operatorname{PSL}_2$ and the $BN$-pair to be standard. Our approach is via the theory of…
Let $(K,\nu)$ be a real closed valued field, and let $S\subseteq K^n$ be a definable open semi-algebraic set. We find an algebraic characterization of rational functions which are OVF-integral on $S$. We apply the existing model theoretic…
Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…
We propose bounded fitting as a scheme for learning description logic concepts in the presence of ontologies. A main advantage is that the resulting learning algorithms come with theoretical guarantees regarding their generalization to…
Let $T_X$ be the semigroup of all non-invertible transformations on an arbitrary set $X$. It is known that $T_X$ is a regular semigroup. The principal right(left) ideals of a regular semigroup $S$ with partial left(right) translations as…
A new class of fully decoupled consistent splitting schemes for the Navier-Stokes equations are constructed and analyzed in this paper. The schemes are based on the Taylor expansion at $t^{n+\beta}$ with $\beta\ge 1$ being a free parameter.…
Consider a linear system of equations with interval coefficients, and each interval coefficient is associated with either a universal or an existential quantifier. The AE solution set and AE solvability of the system is defined by…
The following is true in the Solovay model. 1. If $\le$ is a Borel partial order on a set $D$ of the reals, and $X$ is a ROD subset of $D$ linearly ordered by $\le$, then the restriction of $\le$ onto $X$ is countably cofinal. 2. If in…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…
We study the Onsager algebra from the ideal theoretic point of view. A complete classification of closed ideals and the structure of quotient algebras are obtained. We also discuss the solvable algebra aspect of the Onsager algebra through…
The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is presented in a fashion that will hopefully allow for easy…
In this paper we study the problem of computing a Kolchin characteristic set of a radical differential ideal. The central part of the article is the presentation of algorithms solving this problem in two principal cases: for ordinary…