scientific article; zbMATH DE number 3387326
From MaRDI portal
Publication:5656753
Cited in
(47)- The density of the nonbranching degrees
- Two theorems on degrees of models of true arithmetic
- Decreasing diagrams with two labels are complete for confluence of countable systems
- On the complexity of stream equality
- Independent Gödel sentences and independent sets
- scientific article; zbMATH DE number 3705909 (Why is no real title available?)
- Математические основы теории познания на основе экспериментов
- \(\delta\)-uniform BSS machines
- The minimum degree of recursively representable choice functions
- Machine learning of higher-order programs
- Degrees joining to 0′
- The irregular and non-hyperregular \(\alpha\)-r.e. degrees
- Isomorphism theorem for BSS recursively enumerable sets over real closed fields
- Degrees of Infinite Words, Polynomials and Atoms
- Rice's theorem in effectively enumerable topological spaces
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
- scientific article; zbMATH DE number 3503215 (Why is no real title available?)
- Busy beaver sets and the degrees of unsolvability
- Post's problem and his hypersimple set
- Arithmetic hierarchy of Abelian groups
- Degrees of unsolvability: a tutorial
- Some lowness properties and computational complexity sequences
- A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
- Priority arguments in the continuous r.e. degrees
- Computational complexity, speedable and levelable sets
- Branching Degrees above low Degrees
- Anomalous learning helps succinctness
- Перспективы метаматематических структур в науке
- Spectrum of the field of computable real numbers
- Computably enumerable sets and related issues
- A hierarchy of families of recursively enumerable degrees
- Degrees of transducibility
- Lower bounds on degrees of game-theoretic structures
- Degrees of infinite words, polynomials and atoms
- Transducer degrees: atoms, infima and suprema
- Double jumps of minimal degrees
- Generalized rewrite theories, coherence completion, and symbolic methods
- α-Degrees of maximal α-r.e. sets
- Automorphism bases for degrees of unsolvability
- Comparison of identification criteria for machine inductive inference
- \(r\)-maximal major subsets
- Social choice and computational complexity
- Some elementary degree-theoretic reasons why structures need similarity types
- scientific article; zbMATH DE number 7199582 (Why is no real title available?)
- On the computability of ordered fields
- A recursion theoretic analysis of the clopen Ramsey theorem
- Axiomatizing the existential theory of \(\mathbb{F}_q((t))\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656753)
