Related papers: On The Model Of Hyperrational Numbers With Selecti…
We propose the Transcendental Encoding Conjecture for decision problems, which asserts that every language in complexity class P encodes to an algebraic real (possibly rational or algebraic irrational) under its binary characteristic…
We modify the definable ultrapower construction of Kanovei and Shelah (2004) to develop a ZF-definable extension of the continuum with transfer provable using countable choice only, with an additional mild hypothesis on well-ordering…
We illustrate the power of Experimental Mathematics and Symbolic Computation to suggest irrationality proofs of natural constants, and the determination of their irrationality measures. Sometimes such proofs can be fully automated, but…
Hypercomplex numbers are unital algebras over the real numbers. We offer a short demonstration of the practical value of hypercomplex analytic functions in the field of partial differential equations.
Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…
We define a class of rational numbers including, as a particular case, the classical harmonic numbers. For one particular instance we apply it to the expansion into powers series of a special function, and also detail its relashionship with…
A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…
We prove a strong dichotomy for the number of ultrapowers of a given countable model associated with nonprincipal ultrafilters on N. They are either all isomorphic, or else there are $2^{2^{\aleph_0}}$ many nonisomorphic ultrapowers. We…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
We construct a model in which the splitting number is large and every ultrafilter has a small subset with no pseudo-intersection.
We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with…
We construct, using mild combinatorial hypotheses, a real Menger set that is not Scheepers, and two real sets that are Menger in all finite powers, with a non-Menger product. By a forcing-theoretic argument, we show that the same holds in…
In literature, many important combinatorial properties of subsets of N have been studied both with nonstandard techniques and from the point of view of N. In this thesis we mix these two different approaches in a technique that, at the same…
Formal languages are in the core of models of computation and their behavior. A rich family of models for many classes of languages have been widely studied. Hyperproperties lift conventional trace-based languages from a set of execution…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…
For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…
Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…
We prove that every tower of normal filters of height $\gd$ ($\gd$ supercompact) is precipitous assuming that each normal filter in the tower is the club filter restricted to a stationary set. We give an example to show that this assumption…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…