Related papers: Finiteness and Computation in Toposes
The so-called topos approach provides a radical reformulation of quantum theory. Structurally, quantum theory in the topos formulation is very similar to classical physics. There is a state object, analogous to the state space of a…
We seek progress in the study of subtoposes of the effective topos. First we treat Van Oosten's result that local operators on the effective topos are internally NNO-indexed joins of what we shall call 'basic' local operators. Our main…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
In his remarkable paper Formalism64, Robinson defends his philsophocal position as follows: (i) Any mention of infinite totalities is literally meaningless. (ii) We should act as if infinite totalities really existed. Being the originator…
We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…
In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy…
The unrivaled robustness of topologically ordered states of matter against perturbations has immediate applications in quantum computing and quantum metrology, yet their very existence poses a challenge to our understanding of phase…
We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and…
Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
Finite-dimensional Jacobian algebras are studied from the perspective of representation types. We establish that (like other representation types) the notions of $E$-finiteness and $E$-tameness are invariant under mutations of quivers with…
We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We study in this paper different topos-theoretical approaches to the problem of construction of General Theory of Relativity. In general case the resulting space-time theory will be non-classical, different from that of the usual Einstein…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
The Principle of Relativity has so far been understood as the {\it covariance} of laws of Physics with respect to a general class of reference frame transformations. That relativity, however, has only been expressed with the help of {\it…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We give a characterizations of toposes which admit a generating family of objects which are internally cardinal finite (i.e. Kuratowski finite and decidable) in terms of "topological" conditions. The central result is that, constructively,…