Related papers: Tracking chains revisited
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Several complete congruences on the lattice L(CR) of varieties of completely regular semi- groups have been fundamental to studies of the structure of L(CR). These are the kernel relation K , the left trace relation Tl , the right trace…
Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…
We consider the class of interval maps with dense set of periodic points CP and its closure Cl(CP) equipped with the metric of uniform convergence. Besides studying basic topological properties and density results in the spaces CP and…
For two causal structures with the same set of visible variables, one is said to observationally dominate the other if the set of distributions over the visible variables realizable by the first contains the set of distributions over the…
This is the first in a series of several articles. Our general purpose is to investigate Carlson's <_1-relation in the whole class of ordinals and later link it with ordinals of proof-theoretic interests. In this introductory article, after…
The theory of resurgence uniquely associates a factorially divergent formal power series with a collection of exponentially small non-perturbative corrections paired with a set of complex numbers known as Stokes constants. When the Borel…
Lattice-model simulations and experiments of some small proteins suggest that folding is essentially controlled by a few conserved contacts. Residues of these conserved contacts form the minimum set of native contacts needed to ensure…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
Most elementary numerical schemes found useful for solving classical trajectory problems are {\it canonical transformations}. This fact should be make more widely known among teachers of computational physics and Hamiltonian mechanics. From…
We describe an ACL2 package for defining partial recursive functions that also supports efficient execution. While packages for defining partial recursive functions already exist for other theorem provers, they often require inductive…
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
We use quasi-orders to describe the structure of C-groups. We do this by associating a quasi-order to each compatible C-relation of a group, and then give the structure of such quasi-ordered groups. We also reformulate in terms of…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
The study of well quasi-orders, wqo, is a cornerstone of combinatorics and within wqo theory Kruskal's theorem plays a crucial role. Extending previous proof-theoretic results, we calculate the $\Pi^1_1$ ordinals of two different versions…
We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
In binary and ordinal regression one can distinguish between a location component and a scaling component. While the former determines the location within the range of the response categories, the scaling indicates variance heterogeneity.…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…