Listing 1 - 8 of 8 |
Sort by
|
Choose an application
Automatic theorem proving --- Logic, symbolic and mathematical --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Artificial intelligence --- Proof theory --- Automatic theorem proving. --- Logic, Symbolic and mathematical. --- Computer science --- Informatique --- Théorèmes --- Démonstration automatique --- Logic Computation --- Symbolic Computation --- Mathematical Logic
Choose an application
Mathematical logic --- Logic, Symbolic and mathematical --- Type theory --- Logique symbolique et mathématique --- Théorie des types --- Logic, symbolic and mathematical --- Type Theory --- Logique symbolique et mathématique --- Théorie des types --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Semantics --- Propositional Calculus --- Type --- Logic
Choose an application
wiskunde --- Mathematics --- Algebra, Abstract --- Combinatorial analysis --- Logic, Symbolic and mathematical --- Outlines, syllabi, etc --- -Combinatorial analysis --- -Logic, Symbolic and mathematical --- -512.64 --- 681.3*G2 --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Metamathematics --- Set theory --- Syllogism --- Combinatorics --- Algebra --- Mathematical analysis --- Abstract algebra --- Algebra, Universal --- Linear and multilinear algebra. Matrix theory --- Discrete mathematics (Mathematics of computing) --- Outlines, syllabi, etc. --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 512.64 Linear and multilinear algebra. Matrix theory --- 512.64 --- Algebra, Abstract - Outlines, syllabi, etc. --- Combinatorial analysis - Outlines, syllabi, etc. --- Logic, Symbolic and mathematical - Outlines, syllabi, etc.
Choose an application
Categories (Mathematics) --- Category theory (Mathematics) --- Algebra, Homological --- Algebra, Universal --- Group theory --- Logic, Symbolic and mathematical --- Topology --- Functor theory --- #KVIV --- 512.58 --- 512.58 Categories. Category theory --- Categories. Category theory --- Mathematical logic --- Ordered algebraic structures --- Categories (Mathematics). --- Logique algébrique. --- Algebraic logic
Choose an application
Automatic theorem proving. --- Logic, Symbolic and mathematical. --- Mathematics --- Data processing. --- Théorèmes --- Démonstration automatique --- -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) --- Théorèmes --- Démonstration automatique --- Automatic theorem proving --- Logic, Symbolic and mathematical --- 681.3*I23 --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Artificial intelligence --- Proof theory --- Data processing --- Logic, symbolic and mathematical --- Mathématiques --- Logique symbolique et mathématique --- Informatique --- Intelligence artificielle --- Mathematics - Data processing --- proof --- Pattern Matching --- Theorem Proving
Choose an application
Computer science --- Machine theory --- Formal languages --- Computational complexity --- Automates mathématiques, Théorie des --- Langages formels --- Complexité de calcul (Informatique) --- Computational Complexity --- 510.5 --- #TELE:SISTA --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formalization (Linguistics) --- Language and languages --- Complexity, Computational --- Electronic data processing --- Algorithms. Computable functions --- Computational complexity. --- Formal languages. --- Machine theory. --- 510.5 Algorithms. Computable functions --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique) --- Informatique --- Computer science. --- Language --- Automates abstraits
Choose an application
Programming --- Mathematical logic --- Programming languages (Electronic computers) --- Logic, symbolic and mathematical --- Logic, Symbolic and mathematical --- 681.3*D3 --- 681.3*F31 --- 681.3*F41 --- 681.3*I2 --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Programming languages --- 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} --- Artificial intelligence. AI --- Logic, Symbolic and mathematical. --- Programming languages (Electronic computers). --- 681.3*I2 Artificial intelligence. AI --- 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*D3 Programming languages --- Logic programming --- Specification --- proof --- Learning
Choose an application
Programming --- Computer science --- Machine theory --- Computational complexity --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique) --- Machine theory. --- Computational complexity. --- #TELE:SISTA --- 681.3*F --- 681.3*F13 --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Complexity, Computational --- Electronic data processing --- Theory of computation --- 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} --- 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} --- 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} --- 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*F Theory of computation --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique)
Listing 1 - 8 of 8 |
Sort by
|