美国数学评论2000年数学分类号

MSC2000 MSC2000 The following mathematics subject classification, MSC2000, is the revision of the 1991 Mathematics Subject Classification (MSC), which is the classification that has been used by the two reviewing journals Mathematical Reviews (MR) and Zentralblatt MATH (Zbl) since the beginning of 1991. MSC2000 is the result of a collaborative effort by the editors of MR and Zbl to update the classification. The editors acknowledge the many helpful suggestions from the mathematical community during the revision process. MR and Zbl started using the new classification MSC2000 in January of the year 2000. The encoding for mathematics and accents is TeX. Each entry is on a single line. This particular edition, prepared in May 2009, reflects a small number of corrections made in the previous decade by Mathematical Reviews and Zentralblatt MATH since the first publication of MSC2000. It is the basis from which the revision to MSC2010 was made. How to use the Mathematics Subject Classification [MSC] The main purpose of the classification of items in the mathematical literature using the Mathematics Subject Classification scheme is to help users find the items of present or potential interest to them as readily as possible—in products derived from the Mathematical Reviews Database (MRDB), in Zentralblatt MATH (ZMATH), or anywhere else where this classification scheme is used. An item in the mathematical literature should be classified so as to attract the attention of all those possibly interested in it. The item may be something which falls squarely within one clear area of the MSC, or it may involve several areas. Ideally, the MSC codes attached to an item should represent the subjects to which the item contains a contribution. The classification should serve both those closely concerned with specific subject areas, and those familiar enough with subjects to apply their results and methods elsewhere, inside or outside of mathematics. It will be extremely useful for both users and classifiers to familiarize themselves with the entire classification system and thus to become aware of all the classifications of possible interest to them. Every item in the MRDB or ZMATH receives precisely one primary classification, which is simply the MSC code that describes its principal contribution. When an item contains several principal contributions to different areas, the primary classification should cover the most important among them. A paper or book may be assigned one or several secondary classification numbers to cover any remaining principal contributions, ancillary results, motivation or origin of the matters discussed, intended or potential field of application, or other significant aspects worthy of notice. The principal contribution is meant to be the one including the most important part of the work actually done in the item. For example, a paper whose main overall content is the solution of a problem in graph theory, which arose in computer science and whose solution is (perhaps) at present only of interest to computer scientists, would have a primary classification in 05C (Graph Theory) with one or more secondary classifications in 68 (Computer Science); conversely, a paper whose overall content lies mainly in computer science should receive a primary classification in 68, even if it makes heavy use of graph theory and proves several new graph-theoretic results along the way. There are two types of cross-references given at the end of many of the entries in the MSC. The first type is in braces: “{For A, see X}”; if this appears in section Y, it means that contributions described by A should usually be assigned the classification code X, not Y. The other type of cross-reference merely points out related classifications; it is in brackets: “[See also . . . ]”, “[See mainly . . . ]”, etc., and the classification codes listed in the brackets may, but need not, be included in the classification codes of a paper, or they may be used in place of the classification where the cross-reference is given. The classifier must judge which classification is the most appropriate for the paper at hand. 00-XX GENERAL 00-01 Instructional exposition (textbooks, tutorial papers, etc.) 00-02 Research exposition (monographs, survey articles) 00Axx General and miscellaneous specific topics 00A05 General mathematics 00A06 Mathematics for nonmathematicians (engineering, social sciences, etc.) 00A07 Problem books 00A08 Recreational mathematics [See also 97A20] 00A15 Bibliographies 00A17 External book reviews 00A20 Dictionaries and other general reference works 00A22 Formularies 00A30 Philosophy of mathematics [See also 03A05] 00A35 Methodology of mathematics, didactics [See also 97Cxx, 97Dxx] 00A69 General applied mathematics {For physics, see 00A79 and Sections 70 through 86} 00A71 Theory of mathematical modeling 00A72 General methods of simulation 00A73 Dimensional analysis 00A79 Physics (use more specific entries from Sections 70 through 86 when possible) 00A99 Miscellaneous topics 00Bxx Conference proceedings and collections of papers 00B05 Collections of abstracts of lectures 00B10 Collections of articles of general interest 00B15 Collections of articles of miscellaneous specific content 00B20 Proceedings of conferences of general interest 00B25 Proceedings of conferences of miscellaneous specific interest 00B30 Festschriften 00B50 Volumes of selected translations 00B55 Miscellaneous volumes of translations 00B60 Collections of reprinted articles [See also 01A75] 01-XX HISTORY AND BIOGRAPHY [See also the classification number –03 in the other sections] 01-00 General reference works (handbooks, dictionaries, bibliographies, etc.) 01-01 Instructional exposition (textbooks, tutorial papers, etc.) 01-02 Research exposition (monographs, survey articles) 01-06 Proceedings, conferences, collections, etc. 01-08 Computational methods 01Axx History of mathematics and mathematicians 01A05 General histories, source books 01A07 Ethnomathematics, general 01A10 Paleolithic, Neolithic 01A12 Indigenous cultures of the Americas 01A13 Other indigenous cultures (non-European) 01A15 Indigenous European cultures (pre-Greek, etc.) 01A16 Egyptian 01A17 Babylonian 01A20 Greek, Roman 01A25 China 01A27 Japan 01A29 Southeast Asia 01A30 Islam (Medieval) 01A32 India 01A35 Medieval 01A40 15th and 16th centuries, Renaissance 01A45 17th century 01A50 18th century 01A55 19th century 01A60 20th century 01A61 Twenty-first century 01A65 Contemporary 01A67 Future prospectives 01A70 Biographies, obituaries, personalia, bibliographies 01A72 Schools of mathematics 01A73 Universities 01A74 Other institutions and academies 01A75 Collected or selected works; reprintings or translations of classics [See also 00B60] 01A80 Sociology (and profession) of mathematics 01A85 Historiography 01A90 Bibliographic studies 01A99 Miscellaneous topics 03-XX MATHEMATICAL LOGIC AND FOUNDATIONS 03-00 General reference works (handbooks, dictionaries, bibliographies, etc.) 03-01 Instructional exposition (textbooks, tutorial papers, etc.) 03-02 Research exposition (monographs, survey articles) 03-03 Historical (must also be assigned at least one classification number from Section 01) 03-04 Explicit machine computation and programs (not the theory of computation or programming) 03-06 Proceedings, conferences, collections, etc. 03A05 Philosophical and critical {For philosophy of mathematics, see also 00A30} [MSC Source Date: Thursday 08 October 2009 09:16] [Licence: This text is available under the Creative Commons Attribution-Noncommercial-Share Alike License: http://creativecommons.org/licenses/by-nc-sa/3.0/ Additional terms may apply.] MSC200003Bxx S2 03Bxx General logic 03B05 Classical propositional logic 03B10 Classical first-order logic 03B15 Higher-order logic and type theory 03B20 Subsystems of classical logic (including intuitionistic logic) 03B22 Abstract deductive systems 03B25 Decidability of theories and sets of sentences [See also 11U05, 12L05, 20F10] 03B30 Foundations of classical theories (including reverse mathematics) [See also 03F35] 03B35 Mechanization of proofs and logical operations [See also 68T15] 03B40 Combinatory logic and lambda-calculus [See also 68N18] 03B42 Logic of knowledge and belief 03B44 Temporal logic 03B45 Modal logic {For knowledge and belief see 03B42; for temporal logic see 03B44; for provability logic see also 03F45} 03B47 Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) {For proof-theoretic aspects see 03F52} 03B48 Probability and inductive logic [See also 60A05] 03B50 Many-valued logic 03B52 Fuzzy logic; logic of vagueness [See also 68T27, 68T37, 94D05] 03B53 Logics admitting inconsistency (paraconsistent logics, discussive logics, etc.) 03B55 Intermediate logics 03B60 Other nonclassical logic 03B65 Logic of natural languages [See also 68T50, 91F20] 03B70 Logic in computer science [See also 68–XX] 03B80 Other applications of logic 03B99 None of the above, but in this section 03Cxx Model theory 03C05 Equational classes, universal algebra [See also 08Axx, 08Bxx, 18C05] 03C07 Basic properties of first-order languages and structures 03C10 Quantifier elimination, model completeness and related topics 03C13 Finite structures [See also 68Q15, 68Q19] 03C15 Denumerable structures 03C20 Ultraproducts and related constructions 03C25 Model-theoretic forcing 03C30 Other model constructions 03C35 Categoricity and completeness of theories 03C40 Interpolation, preservation, definability 03C45 Classification theory, stability and related concepts 03C50 Models with special properties (saturated, rigid, etc.) 03C52 Properties of classes of models 03C55 Set-theoretic model theory 03C57 Effective and recursion-theoretic model theory [See also 03D45] 03C60 Model-theoretic algebra [See also 08C10, 12Lxx, 13L05] 03C62 Models of arithmetic and set theory [See also 03Hxx] 03C64 Model theory of ordered structures; o-minimality 03C65 Models of other mathematical theories 03C68 Other classical first-order model theory 03C70 Logic on admissible sets 03C75 Other infinitary logic 03C80 Logic with extra quantifiers and operators [See also 03B42, 03B44, 03B45, 03B48] 03C85 Second- and higher-order model theory 03C90 Nonclassical models (Boolean-valued, sheaf, etc.) 03C95 Abstract model theory 03C98 Applications of model theory [See also 03C60] 03C99 None of the above, but in this section 03Dxx Computability and recursion theory 03D03 Thue and Post systems, etc. 03D05 Automata and formal grammars in connection with logical questions [See also 68Q45, 68Q70, 68R15] 03D10 Turing machines and related notions [See also 68Q05] 03D15 Complexity of computation [See also 68Q15, 68Q17] 03D20 Recursive functions and relations, subrecursive hierarchies 03D25 Recursively (computably) enumerable sets and degrees 03D28 Other Turing degree structures 03D30 Other degrees and reducibilities 03D35 Undecidability and degrees of sets of sentences 03D40 Word problems, etc. [See also 06B25, 08A50, 20F10, 68R15] 03D45 Theory of numerations, effectively presented structures [See also 03C57; for intuitionistic and similar approaches see 03F55] 03D50 Recursive equivalence types of sets and structures, isols 03D55 Hierarchies 03D60 Computability and recursion theory on ordinals, admissible sets, etc. 03D65 Higher-type and set recursion theory 03D70 Inductive definability 03D75 Abstract and axiomatic computability and recursion theory 03D80 Applications of computability and recursion theory 03D99 None of the above, but in this section 03Exx Set theory 03E02 Partition relations 03E04 Ordered sets and their cofinalities; pcf theory 03E05 Other combinatorial set theory 03E10 Ordinal and cardinal numbers 03E15 Descriptive set theory [See also 28A05, 54H05] 03E17 Cardinal characteristics of the continuum 03E20 Other classical set theory (including functions, relations, and set algebra) 03E25 Axiom of choice and related propositions 03E30 Axiomatics of classical set theory and its fragments 03E35 Consistency and independence results 03E40 Other aspects of forcing and Boolean-valued models 03E45 Inner models, including constructibility, ordinal definability, and core models 03E47 Other notions of set-theoretic definability 03E50 Continuum hypothesis and Martin’s axiom 03E55 Large cardinals 03E60 Determinacy principles 03E65 Other hypotheses and axioms 03E70 Nonclassical and second-order set theories 03E72 Fuzzy set theory 03E75 Applications of set theory 03E99 None of the above, but in this section 03Fxx Proof theory and constructive mathematics 03F03 Proof theory, general 03F05 Cut-elimination and normal-form theorems 03F07 Structure of proofs 03F10 Functionals in proof theory 03F15 Recursive ordinals and ordinal notations 03F20 Complexity of proofs 03F25 Relative consistency and interpretations 03F30 First-order arithmetic and fragments 03F35 Second- and higher-order arithmetic and fragments [See also 03B30] 03F40 Go¨del numberings in proof theory 03F45 Provability logics and related algebras (e.g., diagonalizable algebras) [See also 03B45, 03G25, 06E25] 03F50 Metamathematics of constructive systems 03F52 Linear logic and other substructural logics [See also 03B47] 03F55 Intuitionistic mathematics 03F60 Constructive and recursive analysis [See also 03B30, 03D45, 26E40, 46S30, 47S30] 03F65 Other constructive mathematics [See also 03D45] 03F99 None of the above, but in this section 03Gxx Algebraic logic 03G05 Boolean algebras [See also 06Exx] 03G10 Lattices and related structures [See also 06Bxx] 03G12 Quantum logic [See also 06C15, 81P10] 03G15 Cylindric and polyadic algebras; relation algebras 03G20 Lukasiewicz and Post algebras [See also 06D25, 06D30] 03G25 Other algebras related to logic [See also 03F45, 06D20, 06E25, 06F35] 03G30 Categorical logic, topoi [See also 18B25, 18C05, 18C10] 03G99 None of the above, but in this section 03Hxx Nonstandard models [See also 03C62] 03H05 Nonstandard models in mathematics [See also 26E35, 28E05, 30G06, 46S20, 47S20, 54J05] 03H10 Other applications of nonstandard models (economics, physics, etc.) 03H15 Nonstandard models of arithmetic [See also 11U10, 12L15, 13L05] 03H99 None of the above, but in this section 05-XX COMBINATORICS {For finite fields, see 11Txx} 05-00 General reference works (handbooks, dictionaries, bibliographies, etc.) 05-01 Instructional exposition (textbooks, tutorial papers, etc.) 05-02 Research exposition (monographs, survey articles) 05-03 Historical (must also be assigned at least one classification number from Section 01) 05-04 Explicit machine computation and programs (not the theory of computation or programming) 05-06 Proceedings, conferences, collections, etc. 05Axx Enumerative combinatorics 05A05 Combinatorial choice problems (subsets, representatives, permutations) 05A10 Factorials, binomial coefficients, combinatorial functions [See also 11B65, 33Cxx] 05A15 Exact enumeration problems, generating functions [See also 33Cxx, 33Dxx] 05A16 Asymptotic enumeration 05A17 Partitions of integers [See also 11P81, 11P82, 11P83] [MSC Source Date: Thursday 08 October 2009 09:16] [Licence: This text is available under the Creative Commons Attribution-Noncommercial-Share Alike License: http://creativecommons.org/licenses/by-nc-sa/3.0/ Additional terms may apply.] MSC2000S3 08Axx 05A18 Partitions of sets 05A19 Combinatorial identities 05A20 Combinatorial inequalities 05A30 q-calculus and related topics [See also 03Dxx] 05A40 Umbral calculus 05A99 None of the above, but in this section 05Bxx Designs and configurations {For applications of design theory, see 94C30} 05B05 Block designs [See also 51E05, 62K10] 05B07 Triple systems 05B10 Difference sets (number-theoretic, group-theoretic, etc.) [See also 11B13] 05B15 Orthogonal arrays, Latin squares, Room squares 05B20 Matrices (incidence, Hadamard, etc.) 05B25 Finite geometries [See also 51D20, 51Exx] 05B30 Other designs, configurations [See also 51E30] 05B35 Matroids, geometric lattices [See also 52B40, 90C27] 05B40 Packing and covering [See also 11H31, 52C15, 52C17] 05B45 Tessellation and tiling problems [See also 52C20, 52C22] 05B50 Polyominoes 05B99 None of the above, but in this section 05Cxx Graph theory {For applications of graphs, see 68R10, 90C35, 94C15} 05C05 Trees 05C07 Degree sequences 05C10 Topological graph theory, imbedding [See also 57M15, 57M25] 05C12 Distance in graphs 05C15 Coloring of graphs and hypergraphs 05C17 Perfect graphs 05C20 Directed graphs (digraphs), tournaments 05C22 Signed, gain and biased graphs 05C25 Graphs and groups [See also 20F65] 05C30 Enumeration of graphs and maps 05C35 Extremal problems [See also 90C35] 05C38 Paths and cycles [See also 90B10] 05C40 Connectivity 05C45 Eulerian and Hamiltonian graphs 05C50 Graphs and matrices 05C55 Generalized Ramsey theory 05C60 Isomorphism problems (reconstruction conjecture, etc.) 05C62 Graph representations (geometric and intersection representations, etc.) 05C65 Hypergraphs 05C69 Dominating sets, independent sets, cliques 05C70 Factorization, matching, covering and packing 05C75 Structural characterization of types of graphs 05C78 Graph labelling (graceful graphs, bandwidth, etc.) 05C80 Random graphs 05C83 Graph minors 05C85 Graph algorithms [See also 68R10, 68W05] 05C90 Applications 05C99 None of the above, but in this section 05Dxx Extremal combinatorics 05D05 Extremal set theory 05D10 Ramsey theory 05D15 Transversal (matching) theory 05D40 Probabilistic methods 05D99 None of the above, but in this section 05Exx Algebraic combinatorics 05E05 Symmetric functions 05E10 Tableaux, representations of the symmetric group [See also 20C30] 05E15 Combinatorial problems concerning the classical groups [See also 22E45, 33C80] 05E20 Group actions on designs, geometries and codes 05E25 Group actions on posets and homology groups of posets [See also 06A11] 05E30 Association schemes, strongly regular graphs 05E35 Orthogonal polynomials [See also 33C45, 33C50, 33D45] 05E99 None of the above, but in this section 06-XX ORDER, LATTICES, ORDERED ALGEBRAIC STRUCTURES [See also 18B35] 06-00 General reference works (handbooks, dictionaries, bibliographies, etc.) 06-01 Instructional exposition (textbooks, tutorial papers, etc.) 06-02 Research exposition (monographs, survey articles) 06-03 Historical (must also be assigned at least one classification number from Section 01) 06-04 Explicit machine computation and programs (not the theory of computation or programming) 06-06 Proceedings, conferences, collections, etc. 06Axx Ordered sets 06A05 Total order 06A06 Partial order, general 06A07 Combinatorics of partially ordered sets 06A11 Algebraic aspects of posets [See also 05E25] 06A12 Semilattices [See also 20M10; for topological semilattices see 22A26] 06A15 Galois correspondences, closure operators 06A99 None of the above, but in this section 06Bxx Lattices [See also 03G10] 06B05 Structure theory 06B10 Ideals, congruence relations 06B15 Representation theory 06B20 Varieties of lattices 06B23 Complete lattices, completions 06B25 Free lattices, projective lattices, word problems [See also 03D40, 08A50, 20F10] 06B30 Topological lattices, order topologies [See also 06F30, 22A26, 54F05, 54H12] 06B35 Continuous lattices and posets, applications [See also 06B30, 06D10, 06F30, 18B35, 22A26, 68Q55] 06B99 None of the above, but in this section 06Cxx Modular lattices, complemented lattices 06C05 Modular lattices, Desarguesian lattices 06C10 Semimodular lattices, geometric lattices 06C15 Complemented lattices, orthocomplemented lattices and posets [See also 03G12, 81P10] 06C20 Complemented modular lattices, continuous geometries 06C99 None of the above, but in this section 06Dxx Distributive lattices 06D05 Structure and representation theory 06D10 Complete distributivity 06D15 Pseudocomplemented lattices 06D20 Heyting algebras [See also 03G25] 06D22 Frames, loc