Related papers: On the Continuity Set of an omega Rational Functio…
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
A Cech closure space $(X,u)$ is a set $X$ with a (Cech) closure operator $u$ which need not be idempotent. Many properties which hold in topological spaces hold in Cech closure spaces as well. The notions of proper (splitting) and…
We show that in contrast with the Cohen version of Solovay's model, it is consistent for the continuum to be Cohen-measurable and for every function to be continuous on a non-meagre set.
The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be fully abstract, i.e. a…
In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…
We show that a rational function $f$ of degree $>1$ on the projective line over an algebraically closed field that is complete with respect to a non-trivial and non-archimedean absolute value has no potentially good reductions if and only…
For a function $F: X \to Y$ between real Banach spaces, we show how continuation methods to solve $F(u) = g$ may improve from basic understanding of the critical set $C$ of $F$. The algorithm aims at special points with a large number of…
Kawamura and Cook specified the least set of information about a continuous function on the unit interval which is needed for fast function evaluation. This paper presents a variation of their result. To make the above statement precise,…
The original F5 algorithm introduced by Faug\`ere is formulated for any homogeneous polynomial set input. The correctness of output is shown for any input that terminates the algorithm, but the termination itself is proved only for the case…
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…
It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…
Let g:X -> Y be a smooth (i.e. C^\infty differentiable) map between two smooth manifolds. In analogy with the case of complex polynomial functions, we say that y_0 in Y is a typical value of g if there exists an open neighbourhood U of y_0…
Let $K$ be a finitely generated field of characteristic zero. We study, for fixed $m \geq 2$, the rational functions $\phi$ defined over $K$ that have a $K$-orbit containing infinitely many distinct $m$th powers. For $m \geq 5$ we show the…
A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…
The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…
Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…