Narrow your search

Library

IMEC (8)

KU Leuven (8)

UCLouvain (8)

UGent (6)

UAntwerpen (5)

UHasselt (5)

ULB (4)

ULiège (4)

UNamur (3)

VUB (2)

More...

Resource type

book (8)


Language

English (8)


Year
From To Submit

1997 (1)

1988 (1)

1986 (2)

1985 (1)

1983 (1)

More...
Listing 1 - 8 of 8
Sort by

Book
An introduction to mathematical logic and type theory : to truth through proof
Author:
ISBN: 0120585367 0120585359 9780120585366 Year: 1986 Publisher: Orlando: Academic press,

Introduction to higher order categorical logic
Authors: ---
ISBN: 0521246652 9780521246651 Year: 1986 Volume: 7 Publisher: Cambridge : Cambridge University Press,

The computer modelling of mathematical reasoning
Author:
ISBN: 0121412520 0121412504 9780121412500 9780121412524 Year: 1983 Publisher: London : Academic Press,


Book
Mathematical logic and programming languages
Authors: ---
ISBN: 0135614651 9780135614655 Year: 1985 Publisher: Englewood Cliffs (N.J.) Prentice Hall

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

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

Introduction to the theory of computation.
Author:
ISBN: 053494728X 9780534947286 Year: 1997 Publisher: London International Thomson Publishing Ltd.

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

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