CONSTRUCTIVE ALGEBRAS I
From MaRDI portal
Publication:5338325
DOI10.1070/rm1961v016n03ABEH001120zbMath0129.25903MaRDI QIDQ5338325
Publication date: 1961
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Related Items (79)
New degree spectra of Polish spaces ⋮ The Diophantine problem in the classical matrix groups ⋮ A notion of effectiveness in arbitrary structures ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ A recursive second order initial algebra specification of primitive recursion ⋮ Homomorphisms onto effectively separable algebras ⋮ Abelian \(p\)-groups and the halting problem ⋮ Effectively categorical abelian groups ⋮ Fields of algebraic numbers computable in polynomial time. II ⋮ Algebraic specifications of computable and semicomputable data types ⋮ On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions ⋮ Definability of linear orders over negative equivalences ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ Algorithmic properties of structures ⋮ Prime Model with No Degree of Autostability Relative to Strong Constructivizations ⋮ On a question of Kalimullin ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Computably separable models ⋮ On a conjecture of Bergstra and Tucker ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ Punctual copies of algebraic structures ⋮ Graphs are not universal for online computability ⋮ Primitive recursive reverse mathematics ⋮ Two theorems on minimal generalized computable numberings ⋮ Numberings, c.e. oracles, and fixed points ⋮ Computable torsion abelian groups ⋮ Degrees of relative computable categoricity ⋮ On the effective universality of mereological theories ⋮ Enumerating abelian \(p\)-groups ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Embeddings into left‐orderable simple groups ⋮ Separating notions in effective topology ⋮ A structure of punctual dimension two ⋮ Computability and universal determinability of negatively representable models ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Topological spaces over algorithmic representations of universal algebras ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ Strong degrees of categoricity and weak density ⋮ Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ The complexity of computable categoricity ⋮ Ideals in computable rings ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Independence in computable algebra ⋮ Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals ⋮ Proper divisibility in computable rings ⋮ Anatoly Ivanovich Maltsev ⋮ Negative dense linear orders ⋮ Categoricity spectra for polymodal algebras ⋮ Final algebras, cosemicomputable algebras and degrees of unsolvability ⋮ Algebraic structures computable without delay ⋮ Stability for Effective Algebras ⋮ The conjugacy problem in the Grigorchuk group is polynomial time decidable. ⋮ Three Paths to Effectiveness ⋮ Degrees of categoricity of rigid structures ⋮ The back-and-forth method and computability without delay ⋮ Punctual categoricity relative to a computable oracle ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ Computable topological groups and Pontryagin duality ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ Categoricity spectra of computable structures ⋮ Precomplete numberings ⋮ Computable presentability of countable linear orders ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Non-density in punctual computability ⋮ A.D. Taimanov and model theory in Kazakhstan ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Categorical linearly ordered structures ⋮ One-element Rogers semilattices in the Ershov hierarchy ⋮ Structures of degrees of negative representations of linear orders ⋮ The influence of domain interpretations on computational models ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Relativizing computable categoricity ⋮ Finitely generated structures computable in polynomial time ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ Computable topological abelian groups ⋮ Expressiveness and the completeness of Hoare's logic ⋮ The axiomatic semantics of programs based on Hoare's logic
This page was built for publication: CONSTRUCTIVE ALGEBRAS I
