Related papers: Scott's problem for proper Scott sets

In this paper, for a full subcategory $\mathbf{K}$ of the category of all $T_0$ spaces with continuous mappings, we investigate the questions under what conditions the $\mathbf{K}$-reflection of a Scott space is still a Scott space and…

We construct and analyze a CutFEM discretization for the Stokes problem based on the Scott-Vogelius pair. The discrete piecewise polynomial spaces are defined on macro-element triangulations which are not fitted to the smooth physical…

As Cook-Levin theorem showed, every NP problem can be reduced to SAT in polynomial time. In this paper I show a simpler and more efficent method to reduce some factorization problems to the satisfability of a boolean formula.

We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…

Let k be an algebraically closed field of characteristic p > 0. Every Artin-Schreier k-curve X has an equation of the form y^p - y = f(x) for some f(x) in k(x) such that p does not divide the least common multiple L of the orders of the…

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

In this paper we will define a qc fundamental group for an arithmetic scheme by quasi-galois closed covers. Then we will give a computation for such a group and will prove that the etale fundamental group of an arithmetic scheme is a normal…

In this paper, we present full models for some Paraconsistent Set Theories (PSTs). These models are built over Fidel semantics where they are specific first-order structures in the sense of Model Theory. These structures are known as…

In the present work, we lay out a new theory showing that all automata can always be co-lexicographically partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width…

In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…

Let $S$ be an algebraic semigroup (not necessarily linear) defined over a field $F$. We show that there exists a positive integer $n$ such that $x^n$ belongs to a subgroup of $S(F)$ for any $x \in S(F)$. In particular, the semigroup $S(F)$…

We show under $\sf{ZF} + \sf{DC} + \sf{AD}_{\mathbb{R}}$ that every set of reals is $I$-regular for any $\sigma$-ideal $I$ on the Baire space $\omega^{\omega}$ such that $\mathbb{P}_I$ is proper. This answers the question of Khomskii. We…

We prove that if a continuous function $f : X \to f(X)$ takes open sets into elements of the Boolean algebra generated by open and closed subsets in $f(X)$, then there exist $X_n \subset X,$ $(n \in \omega)$ such that $f$ is open on every…

The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $\tau$, and use them to give…

This is the first in a series of papers math.AG/0503029, math.AG/0410267, math.AG/0410268 on "configurations" in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite…

Motivated by quantum states with zero transition probability, we introduce the notion of ortho-set which is a set equipped with a relation $\neq_\mathrm{q}$ satisfying: $x\neq_\mathrm{q} y$ implies both $x\neq y$ and $y \neq_\mathrm{q} x$.…

In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…

The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure by polymorphisms of a boolean relation with a…

Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…