Related papers: Uncountable Real Closed Fields with PA Integer Par…

We present a characterization of the completeness of the field of real numbers in the form of a \emph{collection of several equivalent statements} borrowed from algebra, real analysis, general topology, and non-standard analysis. We also…

In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.

All spaces are assumed to be Tychonoff. Given a realcompact space $X$, we denote by $\mathsf{Exp}(X)$ the smallest infinite cardinal $\kappa$ such that $X$ is homeomorphic to a closed subspace of $\mathbb{R}^\kappa$. Our main result shows…

We study the structure of an algebraically closed field with extra function resembling the classical exponentiation on complex numbers.

We show that for 1<n<m, the class Nr_nCA_m known to be non-elementary is pseudo elementary. When n and m are finite we use a two sorted theory, when n is finite and m infinite we use a three sorted one, and finally when both are infinite we…

We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…

Let X be a projective curve over Q and t a non-constant Q-rational function on X of degree n>1. For every integer a pick a points P(a) on X such that t(P(a))=a. Dvornicich and Zannier (1994) proved that for large N the field Q(P(1), ...,…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to…

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

We will show that, consistently, every uncountable set can be continuously mapped onto a non measure zero set, while there exists an uncountable set whose all continuous images into a Polish space are meager.

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

We investigate what henselian valuations on ordered fields are definable in the language of ordered rings. This leads towards a systematic study of the class of ordered fields which are dense in their real closure. Some results have…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

If M is a nonstandard model of Peano Arithmetic, then M is lofty iff M has a simple elementary extension that is recursively saturated. This had previously been known for countable M.

Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a…