Listing 1 - 10 of 10 |
Sort by
|
Choose an application
Choose an application
Model theory. --- Science --- Mathematical models.
Choose an application
Categories (Mathematics). --- Model theory. --- Proposition (Logic).
Choose an application
This book is a modern introduction to model theory which stresses applications to algebra throughout the text. The first half of the book includes classical material on model construction techniques, type spaces, prime models, saturated models, countable models, and indiscernibles and their applications. The author also includes an introduction to stability theory beginning with Morley's Categoricity Theorem and concentrating on omega-stable theories. One significant aspect of this text is the inclusion of chapters on important topics not covered in other introductory texts, such as omega-stable groups and the geometry of strongly minimal sets. The author then goes on to illustrate how these ingredients are used in Hrushovski's applications to diophantine geometry. David Marker is Professor of Mathematics at the University of Illinois at Chicago. His main area of research involves mathematical logic and model theory, and their applications to algebra and geometry. This book was developed from a series of lectures given by the author at the Mathematical Sciences Research Institute in 1998.
Model theory --- Mathematics --- Logic, symbolic and mathematical --- Model theory. --- Algebra --- Mathematical logic --- 510.67 --- Theory of models --- Mathematics. --- Mathematical logic. --- Mathematical Logic and Foundations. --- Logic, Symbolic and mathematical --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism
Choose an application
The Handbook of the Logic of Argument and Inference is an authoritative reference work in a single volume, designed for the attention of senior undergraduates, graduate students and researchers in all the leading research areas concerned with the logic of practical argument and inference. After an introductory chapter, the role of standard logics is surveyed in two chapters. These chapters can serve as a mini-course for interested readers, in deductive and inductive logic, or as a refresher. Then follow two chapters of criticism; one the internal critique and the other the empirical critique. The first deals with objections to standard logics (as theories of argument and inference) arising from the research programme in philosophical logic. The second canvasses criticisms arising from work in cognitive and experimental psychology. The next five chapters deal with developments in dialogue logic, interrogative logic, informal logic, probability logic and artificial intelligence. The last chapter surveys formal approaches to practical reasoning and anticipates possible future developments. Taken as a whole the Handbook is a single-volume indication of the present state of the logic of argument and inference at its conceptual and theoretical best. Future editions will periodically incorporate significant new developments.
Logica. --- Argumentatie. --- Logic, Symbolic and mathematical. --- Logique symbolique et mathématique --- Logique mathématique --- Logic, Symbolic and mathematical --- 681.3*F41 --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- 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}
Choose an application
517.9 --- Differential equations. Integral equations. Other functional equations. Finite differences. Calculus of variations. Functional analysis --- Teoria dei modelli --- 517.9 Differential equations. Integral equations. Other functional equations. Finite differences. Calculus of variations. Functional analysis --- Groupes, Théorie des --- Group theory --- Classification. --- Logic, Symbolic and mathematical --- Logique mathématique --- Model theory --- Théorie des modèles --- Groupes (algebre) --- Colloque
Choose an application
Cellular automata. --- Computational complexity. --- Automates cellulaires --- Complexité de calcul (Informatique) --- Cellular automata --- Computational complexity --- #SBIB:316.23H1 --- #SBIB:316.23H2 --- #SBIB:16G --- #WSCH:AAS2 --- 5 --- 519.6 --- 004 --- 51 --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- wetenschap --- wetenschapstheorie --- computers --- wiskunde --- fysica --- biologie --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Kennissociologie --- Sociologie van de wetenschappen --- Logica en wetenschapsleer --- Wetenschappen --- Computerwiskunde --- Computerkunde --- Wiskunde --- 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} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Cellulaire automaten --- Complexiteit van berekening --- Cellulaire automaten. --- Complexiteit van berekening. --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 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} --- Computational Complexity --- Complexité de calcul (Informatique) --- Systèmes, Conception de --- System design --- System design. --- Systèmes, Conception de
Choose an application
Logic programming --- Programmation logique --- Congresses. --- Congrès --- 681.3*D16 --- 681.3*D11 --- 681.3*F31 --- 681.3*F41 --- 681.3*I22 --- Computerwetenschap--?*D16 --- Applicative (functional) programming --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 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} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Computer Science --- Engineering & Applied Sciences --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 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*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D11 Applicative (functional) programming --- Congrès --- Computer science. --- Architecture, Computer. --- Software engineering. --- Computer programming. --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Computer System Implementation. --- Logics and Meanings of Programs. --- Programming Techniques. --- Artificial Intelligence (incl. Robotics). --- Mathematical Logic and Formal Languages. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Computer software engineering --- Engineering --- Architecture, Computer --- Informatics --- Science --- Programming --- Computer network architectures. --- Logic design. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Logic programming - Congresses
Choose an application
This volume is a self-contained introduction to interactive proof in high- order logic (HOL), using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses ?rst-order logic and minimizes discussion of meta-theory. It is written for potential users rather than for our colleagues in the research world. Another departure from previous documentation is that we describe Markus Wenzel’s proof script notation instead of ML tactic scripts. The l- ter make it easier to introduce new tactics on the ?y, but hardly anybody does that. Wenzel’s dedicated syntax is elegant, replacing for example eight simpli?cation tactics with a single method, namely simp, with associated - tions. The book has three parts. – The ?rst part, Elementary Techniques, shows how to model functional programs in higher-order logic. Early examples involve lists and the natural numbers. Most proofs are two steps long, consisting of induction on a chosen variable followed by the auto tactic. But even this elementary part covers such advanced topics as nested and mutual recursion. – The second part, Logic and Sets, presents a collection of lower-level tactics that you can use to apply rules selectively. It also describes I- belle/HOL’s treatment of sets, functions, and relations and explains how to de?ne sets inductively. One of the examples concerns the theory of model checking, and another is drawn from a classic textbook on formal languages.
Computer logic --- Automatic theorem proving --- Computer Science --- Engineering & Applied Sciences --- 681.3*D21 --- 681.3*D31 --- 681.3*F31 --- 681.3*F41 --- 681.3*I23 --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Artificial intelligence --- Proof theory --- Computer science logic --- Logic, Symbolic and mathematical --- Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 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} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 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*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D31 Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- 681.3*D21 Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- Computer logic. --- Automatic theorem proving. --- Computer science. --- Logic. --- Programming languages (Electronic computers). --- Computers. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Mathematical Logic and Formal Languages. --- Theory of Computation. --- Artificial Intelligence (incl. Robotics). --- Logics and Meanings of Programs. --- Programming Languages, Compilers, Interpreters. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Languages, Artificial --- Argumentation --- Deduction (Logic) --- Deductive logic --- Dialectic (Logic) --- Logic, Deductive --- Intellect --- Philosophy --- Psychology --- Science --- Reasoning --- Thought and thinking --- Informatics --- Methodology --- Information theory. --- Logic design. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Communication theory --- Communication
Choose an application
Computer Science --- Engineering & Applied Sciences --- Data mining --- Database searching --- Database management: security; integrity; protection--See also {?681.5*E5}--Congressen --- Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing)--Congressen --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31}--Congressen --- 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}--Congressen --- Computer science. --- Mathematical logic. --- Mathematical statistics. --- Database management. --- Information storage and retrieval. --- Artificial intelligence. --- Text processing (Computer science). --- Computer Science. --- Database Management. --- Artificial Intelligence (incl. Robotics). --- Mathematical Logic and Formal Languages. --- Probability and Statistics in Computer Science. --- Document Preparation and Text Processing. --- Information Storage and Retrieval. --- 681.3*F41 <063> --- 681.3*F42 <063> --- 681.3*G3 <063> --- 681.3*H2 <063> --- 681.3*H3 <063> --- 681.3*I2 <063> --- 681.3*I7 <063> --- 681.3*J2 <063> --- 681.3*J2 <063> Physical sciences and engineering (Computer applications)--Congressen --- Physical sciences and engineering (Computer applications)--Congressen --- 681.3*I2 <063> Artificial intelligence. AI--Congressen --- Artificial intelligence. AI--Congressen --- Information storage and retrieval--Congressen --- Text processing (Computing methodologies)--See also {681.3*H4}--Congressen --- Processing, Text (Computer science) --- Database management --- Electronic data processing --- Information storage and retrieval systems --- Word processing --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Mathematics --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Statistical methods --- Natural language processing (Computer science). --- Information storage and retrieva. --- Artificial Intelligence. --- Natural Language Processing (NLP). --- Information storage and retrieval systems. --- NLP (Computer science) --- Artificial intelligence --- Human-computer interaction --- Semantic computing --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Computer systems --- Electronic information resources --- Data libraries --- Digital libraries --- Information organization --- Information retrieval
Listing 1 - 10 of 10 |
Sort by
|