Complete theories of unars

DOI10.1007/BF01979698zbMath0546.08006OpenAlexW1966085402MaRDI QIDQ5896424

Alexandre A. Ivanov

Publication date: 1984

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187255

zbMATH Keywords

unarselementarily equivalent

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05) Interpolation, preservation, definability (03C40) Unary algebras (08A60)

Related Items (5)

Recursive unary algebras and trees ⋮ On algebras of distributions of binary formulas for theories of unars ⋮ Ranks for families of permutation theories ⋮ Learning algebraic structures from text ⋮ A self-induced metric on groupoids and its application to the analysis of cellular interactions in biology

Cites Work

• Minimal models of theories of one function symbol
• An application of games to the completeness problem for formalized theories
• The number of countable models of a theory of one unary function
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete theories of unars