scientific article; zbMATH DE number 1302671
The author summarizes well a great deal of fundamental work on decidability issues for broad classes of algebraic structures. The only crucial assumptions are restrictions to locally finite varieties (and sometimes finitely generated varieties) or varieties of finite type. These assumptions support development of effective methods. Sample results discussed are: (1) Every finitely decidable locally finite congruence distributive variety is congruence permutable and congruence linear; (2) the converse of (1) in the finitely generated setting; and various results that permit us to use Feferman-Vaught type analyses. There is an extensive bibliography of related results. For the entire collection see [Zbl 0913.00019].
- Decidability in analysis
- scientific article; zbMATH DE number 7644092
- Complexity and decidability
- Decidability of definability
- scientific article; zbMATH DE number 4087623
- scientific article; zbMATH DE number 50606
- Complexity, decidability and completeness
- Definability, decidability, complexity
- scientific article; zbMATH DE number 1159716
- Undecidability in Some Structures Related to Computation Theory
- The structure of decidable locally finite varieties
- Decidable discriminator varieties with lattice stalks
- Decidable structures between Church-style and Curry-style
- scientific article; zbMATH DE number 1197054 (Why is no real title available?)
- scientific article; zbMATH DE number 1159716 (Why is no real title available?)
- scientific article; zbMATH DE number 777294 (Why is no real title available?)
- Elementary classification and decidability of theories of derived structures
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 Q4249223)