Related papers: A transfer principle for second-order arithmetic, …
We show that for tame valued fields of equal characteristic with divisible value group, the $C_i$ property lifts from the residue field to the valued field under suitable hypotheses on the residue field. We apply this transfer principle to…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…
We investigate quantum effects in the evolution of general systems. For studying such temporal quantum phenomena, it is paramount to have a rigorous concept and profound understanding of the classical dynamics in such a system in the first…
We define various formal moduli spaces of p-divisible groups which are regular, and morphisms between them. We formulate arithmetic transfer conjectures, which are variants of the arithmetic fundamental lemma conjecture of the third author…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
The transference theory for Lp spaces of Calderon, Coifman, and Weiss is a powerful tool with many applications to singular integrals, ergodic theory, and spectral theory of operators. Transference methods afford a unified approach to many…
In this paper we prove a general form of the Mass Transference Principle for $\limsup$ sets defined via neighbourhoods of sets satisfying a certain local scaling property. Such sets include self-similar sets satisfying the open set…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
Representation choice is of fundamental importance to our ability to communicate and reason effectively. A major unsolved problem, addressed in this paper, is how to devise representational-system (RS) agnostic techniques that drive…
This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…
A basic condition for efficient transfer learning is the similarity between a target model and source models. In practice, however, the similarity condition is difficult to meet or is even violated. Instead of the similarity condition, a…
Most educational literature on conceptual change concerns the process by which introductory students acquire scientific knowledge. However, with modern developments in science and technology, the social significance of learning successive…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…
We prove a de Finetti theorem for exchangeable sequences of states on test spaces, where a test space is a generalization of the sample space of classical probability theory and the Hilbert space of quantum theory. The standard classical…
We establish a general transference principle for the irrationality measure of points with $\mathbb{Q}$-linearly independent coordinates in $\mathbb{R}^{n+1}$, for any given integer $n\geq 1$. On this basis, we recover an important…
Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…
We postulate the applicability of the general form-invariance principle in special relativity. It is shown that this principle holds in classical mechanics. Some examples of transformations between the reference frames which satisfy this…
Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…