Related papers: Martin's conjecture, arithmetic equivalence, and c…
Some general connections between martingales and character ratios of finite groups are developed. As an application we sharpen the convergence rate in a central limit theorem for the character ratio of a random representation of the…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
The classical work of Feferman Vaught gives a powerful, constructive analysis of definability in (generalized) product structures, and certain associated enriched Boolean structures. %structures in terms of definability in the component…
This article gives some properties of intervals in $\mathbb{R}$ and discusses some problems involving intervals for which the concept of outer measure on $\mathbb{R}$ provides a more efficient solution than an elementary approach. The outer…
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…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
An \'etale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model…
Math is widely considered as a powerful tool and its strong appeal depends on the high level of abstraction it allows in modelling a huge number of heterogeneous phenomena and problems, spanning from the static of buildings to the flight of…
This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
Let $\lambda$ be an uncountable cardinal such that $2^{< \lambda } = \lambda$. Working in the setup of generalized descriptive set theory, we study the structure of $\lambda^+$-Borel measurable functions with respect to various kinds of…
The paper is a naive introduction to descriptive set theory. It is aimed mathematicians without a background in logic. The goal is to provide the basic facts used for applications of descriptive set theory to other areas of mathematics,…
This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…
By introducing a new point of view in Algebraic Topology relating elliptic curves in $\mathbb{R}^2$ and suitable bordism groups, the congruent number problem is solved showing that the Tunnell's theorem is also sufficient. This could be…
For a set $X\sbst\R$, let $B(X)\sbst\R^X$ denote the space of Borel real-valued functions on $X$, with the topology inherited from the Tychonoff product $\R^X$. Assume that for each countable $A\sbst B(X)$, each $f$ in the closure of $A$ is…
The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…
We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…
This paper deals with countable products of countable Borel equivalence relations and equivalence relations "just above" those in the Borel reducibility hierarchy. We show that if $E$ is strongly ergodic with respect to $\mu$ then…
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…