Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Model theory --- Stability

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical logic --- Model theory --- Logic, Symbolic and mathematical --- 512 --- -Logic, Symbolic and mathematical --- Algebra --- Congresses --- -Algebra --- 512 Algebra --- -512 Algebra --- Model theory - Congresses --- Logic, Symbolic and mathematical - Congresses

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*F11 --- 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} --- 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*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Logic, Symbolic and mathematical --- Logique mathématique --- Constructive mathematics --- Mathématiques constructives --- Logic, Symbolic and mathematical. --- Logique mathématique. --- Constructive mathematics. --- Mathématiques constructives. --- Logique mathématique --- Récursivité, Théorie de la --- Computational Complexity --- Recursion --- Analysis --- Computability --- Recursive Function --- Flowchart --- Logique mathematique --- Calculabilite

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains revised versions of presentations at the International Workshop on Analogical and Inductive Inference (AII '86) held in Wendisch-Rietz, GDR, October 16-10, 1986. Inductive inference and analogical reasoning are two basic approaches to learning algorithms. Both allow for exciting problems and promising concepts of invoking deeper mathematical results for considerable advances in intelligent software systems. Hence analogical and inductive inference may be understood as a firm mathematical basis for a large variety of problems in artificial intelligence. While the papers on inductive inference contain technical results and reflect the state of the art of this well-developed mathematical theory, those devoted to analogical reasoning reflect the ongoing process of developing the basic concepts of the approach. The workshop thus contributes significantly to the advancement of this field.

Computer science --- Mathematical logic --- 681.3*F41 --- 681.3*I22 --- 681.3*I26 --- 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} --- Learning: analogies; concept learning; induction; knowledge acquisition; language acquisition; parameter learning (Artificial intelligence)--See also {681.3*K32} --- 681.3*I26 Learning: analogies; concept learning; induction; knowledge acquisition; language acquisition; parameter learning (Artificial intelligence)--See also {681.3*K32} --- 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} --- Artificial intelligence. --- Artificial Intelligence. --- 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 --- Congresses

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Ordered algebraic structures --- 681.3*D21 --- 681.3*D31 --- 681.3*D33 --- 681.3*F3 --- 681.3*F41 --- 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} --- Languages constructs: abstract data types; concurrent programming structures;control structures; coroutines (Programming languages) --- Logics and meanings of programs (Theory of computation) --- 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*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D33 Languages constructs: abstract data types; concurrent programming structures;control structures; coroutines (Programming languages) --- 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} --- Topology. --- Logic design. --- Computer science. --- Logic, Symbolic and mathematical. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Mathematical Logic and Foundations. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Analysis situs --- Position analysis --- Rubber-sheet geometry --- Geometry --- Polyhedra --- Algebras, Linear