Related papers: Non-principal ultrafilters, program extraction and…
Highly saturated models are a fundamental part of the model-theoretic machinery of nonstandard analysis. Of the two methods for producing them, ultrapowers constructed with the aid of $\kappa^+$-good ultrafilters seems by far the less…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
The aim of this paper is to bring together two approaches to non-conservative systems -- the generalized variational principle of Herglotz and the fractional calculus of variations. Namely, we consider functionals whose extrema are sought,…
We show the consistency of the set of regular cardinals which are the character of some ultrafilter on omega is not convex. We also deal with the set of pi chi-characters of ultrafilters on omega.
We investigate the combinatorial structure of the set of maximal antichains in a Boolean algebra ordered by almost refinement. We also consider the reaping relation and its associated cardinal invariants, focusing in particular on reduced…
We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…
A variety of classes of naturally arising ultrafilters on omega is discussed, and the question is raised whether it is consistent that the classes are empty. Since all the classes contain the P-point ultrafilters, a negative answer would…
This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^\omega \omega}$ to ${^\omega \omega}$ is analyzed. In that paper, for each $a \in {^\omega \omega}$ we defined a…
Let $A$ be a $C^*$-algebra. Let $E$ and $F$ be Hilbert $A$-modules with $E$ being full. Suppose that $\theta : E\to F$ is a linear map preserving orthogonality, i.e., $<\theta(x), \theta(y) > = 0$ whenever $<x, y > = 0$. We show in this…
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…
Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a constructive proof based on Gaussian elimination. Concurrency is used…
We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…
This paper formalize the existence's proof of first-integrals for any second order ODE, allowing to discriminate periodic orbits. Up to the author's knowledge, such a powerful result is not available in the literature providing a tool to…
It is well known that Principal Component Analysis (PCA) is strongly affected by outliers and a lot of effort has been put into robustification of PCA. In this paper we present a new algorithm for robust PCA minimizing the trimmed…
Three variants of Kurt G\"odel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of G\"odel's argument the two…
We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…
The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…
The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P))…