Applying, extending, and specializing pseudorecursiveness
From MaRDI portal
Publication:598283
DOI10.1016/j.apal.2003.11.027zbMath1047.03033MaRDI QIDQ598283
Publication date: 6 August 2004
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2003.11.027
Computability; Equational logic; Decidable theories; Pseudorecursive varieties; Quantifier reversal; Spectra; Uniformity
03D35: Undecidability and degrees of sets of sentences
03B25: Decidability of theories and sets of sentences
03D15: Complexity of computation (including implicit computational complexity)
03C05: Equational classes, universal algebra in model theory
Related Items
Uses Software
Cites Work
- On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
- Hypercomputation by definition
- A variety with locally solvable but globally unsolvable word problem
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II
- Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität
- PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
- Aperiodic words on three symbols.
- Aperiodic words on three symbols. II.
- A Variety with Solvable, but not Uniformly Solvable, Word Problem
- Turing machines and the spectra of first-order formulas
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems
- Representation theory for polyadic algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item