BOOK-CHAPTER
Efficient decision algorithms for locally finite theories
Year: 1986 Lecture notes in computer science Pages: 262-273 Publisher: Springer Science+Business Media
Keywords:
Quantifier elimination Distributive property Abelian group Class (philosophy) Mathematics Integer (computer science) Discrete mathematics Property (philosophy) Algebra over a field Combinatorics Pure mathematics Computer science Artificial intelligence
Metrics
7
Cited By
3.60
FWCI (Field Weighted Citation Impact)
12
Refs
0.91
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Advanced Algebra and Logic
Physical Sciences → Computer Science → Computational Theory and Mathematics
Algebraic structures and combinatorial models
Physical Sciences → Mathematics → Geometry and Topology
semigroups and automata theory
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
BOOK-CHAPTER
Efficient decision procedures for locally finite theories II
Lecture notes in computer science Year: 1989 Pages: 390-401
JOURNAL ARTICLE
Locally finite theories
Journal: Journal of Symbolic Logic Year: 1986 Vol: 51 (1)Pages: 59-62
JOURNAL ARTICLE
Locally finite weakly minimal theories
Journal: Annals of Pure and Applied Logic Year: 1991 Vol: 55 (2)Pages: 153-203
JOURNAL ARTICLE
Locally modular theories of finite rank
Journal: Annals of Pure and Applied Logic Year: 1986 Vol: 30 (1)Pages: 83-94
JOURNAL ARTICLE
Locally finite countably-categorical Horn theories
Journal: Algebra and Logic Year: 1989 Vol: 28 (4)Pages: 294-301