Theory of representations
From MaRDI portal
An approach for a simple, general, and unified theory of effectivity on sets with cardinality not greater than that of the continuum is presented. A standard theory of effectivity on \({\mathbb{F}}=\{f:{\mathbb{N}}\to {\mathbb{N}}\}\) has been developed in a previous paper. By representations \(\delta\) :\({\mathbb{F}}\to M\) this theory is extended to other sets M. Topological and recursion theoretical properties of representations are studied, where the final topology of a representation plays an essential role. It is shown that for any separable \(T_ 0\)-space an (up to equivalence) unique admissible representation can be defined which reflects the topological properties correctly.
Recommendations
- scientific article; zbMATH DE number 49718
- scientific article; zbMATH DE number 4028127
- scientific article; zbMATH DE number 3035682
- Representations and the foundations of mathematics
- scientific article; zbMATH DE number 4068990
- Representation theory of finite-dimensional algebras
- Representation theory of orders
- Homological Theory of Representations
- scientific article; zbMATH DE number 701897
- scientific article; zbMATH DE number 3887669
Cites work
- Admissible representations of effective cpo's
- Computability concepts for programming language semantics
- Computational complexity of real functions
- Data Types as Lattices
- Effective operations on partial recursive functions
- scientific article; zbMATH DE number 3887669 (Why is no real title available?)
- scientific article; zbMATH DE number 3788601 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- scientific article; zbMATH DE number 3053706 (Why is no real title available?)
- L p -Computability in Recursive Analysis
- Theorie der Numerierungen I
- Type 2 recursion theory
Cited in
(90)- Admissible representations of effective cpo's
- Type 2 recursion theory
- Compactness in constructive analysis revisited
- Representations of the real numbers and of the open subsets of the set of real numbers
- On the complexity of online computations of real functions
- \(\delta\)-uniform BSS machines
- A domain-theoretic approach to computability on the real line
- Equality is a jump
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computable Banach spaces via domain theory
- An effective Riemann Mapping Theorem
- Concrete models of computation for topological algebras
- Computation by `While' programs on topological partial algebras
- Computability on the probability measures on the Borel sets of the unit interval
- Effectiveness of the global modulus of continuity on metric spaces
- Random elements in effective topological spaces with measure.
- Representation theorems for transfinite computability and definability
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- Topological properties of real number representations.
- Foundation of a computable solid modelling.
- Extended admissibility.
- Reducibility of computable metrics on the real line
- Uniqueness conditions of the representation of a topology in \(Top(X)\)
- Computability on computable metric spaces
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computable metrics above the standard real metric
- On the complexity of conversion between classic real number representations
- Quantitative coding and complexity theory of compact metric spaces
- The fixed-point property for represented spaces
- Representations and the foundations of mathematics
- On the maximality of degrees of metrics under computable reducibility
- Axiomatic reals and certified efficient exact real computation
- Computable reducibility of metrics on the reals
- Completion of choice
- Type 2 computational complexity of functions on Cantor's space
- Parametrised second-order complexity theory with applications to the study of interval computation
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
- How constructive is constructing measures?
- Coherence spaces and uniform continuity
- Alan Turing and the foundations of computable analysis
- Coalgebraic representation theory of fractals
- scientific article; zbMATH DE number 3884140 (Why is no real title available?)
- scientific article; zbMATH DE number 3887669 (Why is no real title available?)
- scientific article; zbMATH DE number 4037847 (Why is no real title available?)
- A Real Number Structure that is Effectively Categorical
- scientific article; zbMATH DE number 1746030 (Why is no real title available?)
- scientific article; zbMATH DE number 1746033 (Why is no real title available?)
- Computability on the probability measures on the Borel sets of the unit interval
- A comparison of concepts from computable analysis and effective descriptive set theory
- Towards a descriptive theory of cb\(_{0}\)-spaces
- Theses for computation and recursion on concrete and abstract structures
- scientific article; zbMATH DE number 3993572 (Why is no real title available?)
- A natural weak limit space with admissible representation which is not a limit space
- The solution operator of the Korteweg-de Vries equation is computable
- A relationship between equilogical spaces and type two effectivity
- Computable Riesz representation for locally compact Hausdorff spaces
- A Wadge hierarchy for second countable spaces
- Computable analysis and notions of continuity in \textsc{Coq}
- Admissibly Represented Spaces and Qcb-Spaces
- Weihrauch Complexity in Computable Analysis
- Three topological reducibilities for discontinuous functions
- Continuous and monotone machines
- Foundations of online structure theory. II: The operator approach
- Decision problems for linear recurrences involving arbitrary real numbers
- Degrees of unsolvability of continuous functions
- When series of computable functions with varying domains are computable
- A functional algorithm for exact real integration with invariant measures
- On the topological aspects of the theory of represented spaces
- Some hierarchies of \(\mathsf{QCB}_0\)-spaces
- Weihrauch goes Brouwerian
- Quantitative continuity and Computable Analysis in Coq
- Representation theory and convexity
- THE DISCONTINUITY PROBLEM
- Notes on overt choice
- How much partiality is needed for a theory of computability?
- scientific article; zbMATH DE number 7703272 (Why is no real title available?)
- Computer Science for Continuous Data
- Computable analysis for verified exact real computation
- Second-order parameterizations for the complexity theory of integrable functions
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- On representations of irrational numbers and the computational complexity of converting between such representations
- Effective second countability in computable analysis
- Extracting efficient exact real number computation from proofs in constructive type theory
- Multi-representation associated to the numbering of a subbasis and formal inclusion relations
- On the group of computable automorphisms of the linear order of the reals
- Effective bases and notions of effective second countability in computable analysis
- A semilattice of degrees of computable metrics
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Computing Schrödinger propagators on type-2 Turing machines
This page was built for publication: Theory of representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073022)
