Snow Mountain passage
Subtitle: a novel
By: by James D. Houston
Edition: 1st Harvest ed.
Series: A Harvest book
Publisher: Harcourt
Published: 2002
Place of publication: San Diego
Language: eng
Number of pages: 315
Subjects: Donner Party -- Fiction; Overland journeys to the Pacific -- Fiction; Wilderness survival -- Fiction; California -- History -- 1846-1850 -- Fiction
Genres: Fiction.
Table of contents: title: Machine generated contents note: 1 Basic Concepts 1; title: 1.1 Algebras1; title: 1.2 Examples4; title: 1.3 Subalgebras13; title: 1.4 Congruence Relations and Quotients21; title: 1.5 Exercises27; title: 2 Galois Connections and Closures 31; title: 2.1 Closure Operators 32; title: 2.2 Galois Connections37; title: 2.3 Concept Analysis 42; title: 2.4 Exercises44; title: 3 Homomorphisms and Isomorphisms 47; title: 3.1 The Homomorphism Theorem49; title: 3.2 The Isomorphism Theorems 58; title: 3.3 Exercises61; title: 4 Direct and Subdirect Products 63; title: 4.1 Direct Products63; title: 4.2 Subdirect Products 68; title: 4.3 Exercises72; title: 5 Terms, Trees, and Polynomials 75; title: 5.1 Terms and Trees 76; title: 5.2 Term Operations82; title: 5.3 Polynomials and Polynomial Operations85; title: 5.4 Exercises88; title: 6 Identities and Varieties 91; title: 6.1 The Galois Connection (Id, Mod)91; title: 6.2 Fully Invariant Congruence Relations95; title: 6.3 The Algebraic Consequence Relation97; title: 6.4 Relatively Free Algebras98; title: 6.5 Varieties101; title: 6.6 The Lattice of All Varieties109; title: 6.7 Finite Axiomatizability110; title: 6.8 Exercises113; title: 7 Term Rewriting Systems 115; title: 7.1 Confluence116; title: 7.2 Reduction Systems123; title: 7.3 Term Rewriting129; title: 7.4 Termination of Term Rewriting Systems141; title: 7.5 Exercises145; title: 8 Algebraic Machines 147; title: 8.1 Regular Languages148; title: 8.2 Finite Automata150; title: 8.3 Algebraic Operations on Finite Automata159; title: 8.4 Tree Recognizers165; title: 8.5 Regular Tree Grammars169; title: 8.6 Operations on Tree Languages174; title: 8.7 Minimal Tree Recognizers176; title: 8.8 Tree Transducers 182; title: 8.9 Turing Machines185; title: 8.10 Undecidable Problems187; title: 8.11 Exercises191; title: 9 Mal'cev-Type Conditions 193; title: 9.1 Congruence Permutability193; title: 9.2 Congruence Distributivity195; title: 9.3 Arithmetical Varieties201; title: 9.4 n-Modularity and n-Permutability203; title: 9.5 Congruence Regular Varieties205; title: 9.6 Two-Element Algebras206; title: 9.7 Exercises 213; title: 10 Clones and Completeness 215; title: 10.1 Clones as Algebraic Structures215; title: 10.2 Operations and Relations217; title: 10.3 The Lattice of All Boolean Clones219; title: 10.4 The Functional Completeness Problem228; title: 10.5 Primal Algebras231; title: 10.6 Different Generalizations of Primality240; title: 10.7 Preprimal Algebras245; title: 10.8 Exercises249; title: 11 Tame Congruence Theory 251; title: 11.1 Minimal Algebras 251; title: 11.2 Tame Congruence Relations262; title: 11.3 Permutation Algebras269; title: 11.4 The Types of Minimal Algebras276; title: 11.5 Mal'cev Conditions and Omitting Types281; title: 11.6 Residually Small Varieties286; title: 11.7 Exercises287; title: 12 Term Condition and Commutator 289; title: 12.1 The Term Condition 289; title: 12.2 The Commutator293; title: 12.3 Exercises299; title: 13 Complete Sublattices 301; title: 13.1 Conjugate Pairs of Closure Operators301; title: 13.2 Galois Closed Subrelations308; title: 13.3 Closure Operators on Complete Lattices316; title: 13.4 Exercises323; title: 14 G-Clones and M-Solid Varieties 325; title: 14.1 G-Clones 325; title: 14.2 H-clones331; title: 14.3 M-Solid Varieties334; title: 14.4 Intervals in the Lattice (T)342; title: 14.5 Exercises345; title: 15 Hypersubstitutions and Machines 347; title: 15.1 The Hyperunification Problem347; title: 15.2 Hyper Tree Recognizers349; title: 15.3 Tree Transformations357; title: 15.4 Exercises361.