Applying, extending, and specializing pseudorecursiveness

DOI10.1016/J.APAL.2003.11.027MaRDI QIDQ598283zbMATH OpenOpenAlexFDO

Authors Benjamin Wells

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

zbMATH Keywords

ComputabilityDecidable theoriesEquational logicPseudorecursive varietiesQuantifier reversalSpectraUniformity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• scientific article; zbMATH DE number 5295822
• Pseudorecursive varieties of semigroups. II
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• A non-standard study of the theory of relative recursivity
• On locally finite varieties with undecidable equational theory.

Cites work

• scientific article; zbMATH DE number 3149588 (Why is no real title available?)
• scientific article; zbMATH DE number 3732062 (Why is no real title available?)
• scientific article; zbMATH DE number 3758648 (Why is no real title available?)
• scientific article; zbMATH DE number 108079 (Why is no real title available?)
• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• scientific article; zbMATH DE number 671763 (Why is no real title available?)
• scientific article; zbMATH DE number 1461253 (Why is no real title available?)
• scientific article; zbMATH DE number 1869998 (Why is no real title available?)
• scientific article; zbMATH DE number 7078768 (Why is no real title available?)
• scientific article; zbMATH DE number 3286022 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3310055 (Why is no real title available?)
• scientific article; zbMATH DE number 3339390 (Why is no real title available?)
• A Variety with Solvable, but not Uniformly Solvable, Word Problem
• A finitely axiomatizable undecidable equational theory with recursively solvable word problems
• A variety with locally solvable but globally unsolvable word problem
• Aperiodic words on three symbols.
• Aperiodic words on three symbols. II.
• Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität
• Hypercomputation by definition
• On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• Pseudorecursive varieties of semigroups. II
• Representation theory for polyadic algebras
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
• Turing machines and the spectra of first-order formulas

Cited in

(6)

• scientific article; zbMATH DE number 874495 (Why is no real title available?)
• Hypercomputation by definition
• PSEUDO: applications of streams and lazy evaluation to integrable models
• scientific article; zbMATH DE number 5295822 (Why is no real title available?)
• Leon Henkin and a life of service
• Pseudorecursive varieties of semigroups. II

Describes a project that uses

Uses Software

• Mizar

This page was built for publication: Applying, extending, and specializing pseudorecursiveness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598283)