Listing 1 - 10 of 15 | << page >> |
Sort by
|
Choose an application
This is an up-to-date textbook of model theory taking the reader from first definitions to Morley's theorem and the elementary parts of stability theory. Besides standard results such as the compactness and omitting types theorems, it also describes various links with algebra, including the Skolem-Tarski method of quantifier elimination, model completeness, automorphism groups and omega-categoricity, ultraproducts, O-minimality and structures of finite Morley rank. The material on back-and-forth equivalences, interpretations and zero-one laws can serve as an introduction to applications of model theory in computer science. Each chapter finishes with a brief commentary on the literature and suggestions for further reading. This book will benefit graduate students with an interest in model theory.
Model theory --- Logic, Symbolic and mathematical --- Model theory. --- Mathematical logic
Choose an application
Model theory --- Group theory --- Congresses. --- Model theory - Congresses --- Group theory - Congresses
Choose an application
This volume surveys recent interactions between model theory and other branches of mathematics, notably group theory. Beginning with an introductory chapter describing relevant background material, the book contains contributions from many leading international figures in this area. Topics described include automorphism groups of algebraically closed fields, the model theory of pseudo-finite fields and applications to the subgroup structure of finite Chevalley groups. Model theory of modules, and aspects of model theory of various classes of groups, including free groups, are also discussed. The book also contains the first comprehensive survey of finite covers. Many new proofs and simplifications of recent results are presented and the articles contain many open problems. This book will be a suitable guide for graduate students and a useful reference for researchers working in model theory and algebra.
Model theory --- Group theory --- Logic, Symbolic and mathematical --- Model theory. --- Group theory. --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Model theory - Congresses --- Group theory - Congresses
Choose an application
The study of stable groups connects model theory, algebraic geometry and group theory. It analyses groups which possess a certain very general dependence relation (Shelah's notion of 'forking'), and tries to derive structural properties from this. These may be group-theoretic (nilpotency or solubility of a given group), algebro-geometric (identification of a group as an algebraic group), or model-theoretic (description of the definable sets). In this book, the general theory of stable groups is developed from the beginning (including a chapter on preliminaries in group theory and model theory), concentrating on the model- and group-theoretic aspects. It brings together the various extensions of the original finite rank theory under a unified perspective and provides a coherent exposition of the knowledge in the field.
Group theory. --- Model theory. --- Geometry, Algebraic. --- Algebraic geometry --- Geometry --- Logic, Symbolic and mathematical --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Model theory
Choose an application
Operator theory --- Operator theory. --- Opérateurs, Théorie des. --- Decomposition method. --- Décomposition (méthode mathématique) --- Model theory. --- Théorie des modèles. --- Decomposition method --- Model theory --- Functional analysis --- Logic, Symbolic and mathematical --- Method, Decomposition --- Operations research --- Programming (Mathematics) --- System analysis --- Théorie des modèles
Choose an application
Computer science --- Mathematical logic --- Model theory --- Computational complexity --- Mathematics --- Physical Sciences & Mathematics --- Mathematical Theory --- Complexity, Computational --- Electronic data processing --- Machine theory --- Logic, Symbolic and mathematical
Choose an application
Recent major advances in model theory include connections between model theory and Diophantine and real analytic geometry, permutation groups, and finite algebras. The present book contains lectures on recent results in algebraic model theory, covering topics from the following areas: geometric model theory, the model theory of analytic structures, permutation groups in model theory, the spectra of countable theories, and the structure of finite algebras. Audience: Graduate students in logic and others wishing to keep abreast of current trends in model theory. The lectures contain sufficient introductory material to be able to grasp the recent results presented.
Model theory --- Congresses --- Mathematical logic. --- Algebraic geometry. --- Functions of real variables. --- Group theory. --- Mathematical Logic and Foundations. --- Algebraic Geometry. --- Real Functions. --- Group Theory and Generalizations. --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Real variables --- Functions of complex variables --- Algebraic geometry --- Geometry --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Model theory - Congresses
Choose an application
Henkin-Keisler models emanate from a modification of the Henkin construction introduced by Keisler to motivate the definition of ultraproducts. Keisler modified the Henkin construction at that point at which `new' individual constants are introduced and did so in a way that illuminates a connection between Henkin-Keisler models and ultraproducts. The resulting construction can be viewed both as a specialization of the Henkin construction and as an alternative to the ultraproduct construction. These aspects of the Henkin-Keisler construction are utilized here to present a perspective on ultraproducts and their applications accessible to the reader familiar with Henkin's proof of the completeness of first order logic and naive set theory. This approach culminates in proofs of various forms of the Keisler-Shelah characterizations of elementary equivalence and elementary classes via Henkin-Keisler models. The presentation is self-contained and proofs of more advanced results from set theory are introduced as needed. Audience: Logicians in philosophy, computer science, linguistics and mathematics.
Ultraproducts --- First-order logic --- Mathematics. --- Logic. --- Computer science. --- Mathematical logic. --- Mathematical Logic and Foundations. --- Computer Science, general. --- Logic, Symbolic and mathematical. --- Model theory --- Prime products --- Products, Prime --- Products, Ultra --- -Ultra-products --- Logic, Symbolic and mathematical --- Logic, Modern --- Informatics --- Science --- Argumentation --- Deduction (Logic) --- Deductive logic --- Dialectic (Logic) --- Logic, Deductive --- Intellect --- Philosophy --- Psychology --- Reasoning --- Thought and thinking --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Methodology --- Model theory. --- First-order logic.
Choose an application
1 More than thirty years after its discovery by Abraham Robinson , the ideas and techniques of Nonstandard Analysis (NSA) are being applied across the whole mathematical spectrum,as well as constituting an im portant field of research in their own right. The current methods of NSA now greatly extend Robinson's original work with infinitesimals. However, while the range of applications is broad, certain fundamental themes re cur. The nonstandard framework allows many informal ideas (that could loosely be described as idealisation) to be made precise and tractable. For example, the real line can (in this framework) be treated simultaneously as both a continuum and a discrete set of points; and a similar dual ap proach can be used to link the notions infinite and finite, rough and smooth. This has provided some powerful tools for the research mathematician - for example Loeb measure spaces in stochastic analysis and its applications, and nonstandard hulls in Banach spaces. The achievements of NSA can be summarised under the headings (i) explanation - giving fresh insight or new approaches to established theories; (ii) discovery - leading to new results in many fields; (iii) invention - providing new, rich structures that are useful in modelling and representation, as well as being of interest in their own right. The aim of the present volume is to make the power and range of appli cability of NSA more widely known and available to research mathemati cians.
Nonstandard mathematical analysis --- Congresses. --- Mathematical analysis [Nonstandard ] --- Congresses --- Mathematical analysis. --- Analysis (Mathematics). --- Probabilities. --- Functional analysis. --- Applied mathematics. --- Engineering mathematics. --- Fluids. --- Analysis. --- Probability Theory and Stochastic Processes. --- Functional Analysis. --- Applications of Mathematics. --- Fluid- and Aerodynamics. --- Hydraulics --- Mechanics --- Physics --- Hydrostatics --- Permeability --- Engineering --- Engineering analysis --- Mathematical analysis --- Functional calculus --- Calculus of variations --- Functional equations --- Integral equations --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- 517.1 Mathematical analysis --- Analysis, Nonstandard mathematical --- Mathematical analysis, Nonstandard --- Non-standard analysis --- Nonstandard analysis --- Model theory --- Nonstandard mathematical analysis - Congresses
Choose an application
681.3*F11 --- 681.3*F13 --- 681.3*F41 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic --- Decidability (Mathematical logic) --- Health Sciences --- Life Sciences --- Immunology --- Pathology --- Computable functions --- Gödel's theorem --- Logic, Symbolic and mathematical --- Recursive functions
Listing 1 - 10 of 15 | << page >> |
Sort by
|