Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2018/2019

Logics

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
17PBILOG Z,ZK 4 2P+2C Czech
Lecturer:
Dagmar Brechlerová, Petr Maršálek (guarantor), Dagmar Brechlerová
Tutor:
Dagmar Brechlerová, Dagmar Brechlerová
Supervisor:
Department of Biomedical Informatics
Synopsis:

Logic system, logic circuit, logic function. Bool's algebra. Representation (models) of logic functions: expression/formula, table, cube, map, logical and functional schema, graph. Combinatorial and sequential logic nets. Huffman's schema. Minimization of expressions for combinatorial logical nets with one and more outputs. Normalized expressions, disjunctive and conjunctive forms. Minimization based on operations of Bool's algebra in expressions, in a unit cube, in a truth table (Quin-McCluskey's method), in a logic map - Karnaugh's maps.

Combinatorial logical terms, circuits and blocks. Synthesis of combinatorial logic circuits NOT, AND, OR, NAND, NOR. Synthesis of combinatorial logic circuits with limited number of inputs. Modeling of sequential behavior. Finite automata: Mealy and Moore automata. Memory circuits. Analysis and synthesis of synchronized sequential nets. Asynchronous sequential logic nets.

Predicate logic (PL): language, terms, formula, substitution and basic syntactic terms, semantics: structures for predicate logic, evaluation, evaluation of terms and formulas. Axiomatic system of PL: axioms, inference rules, concept of a proof, reasoning theorem.

Requirements:

Basics of algebra

Syllabus of lectures:

1.Logic system, logic circuit, logic function. Bool's algebra.

2.Representation (models) of logic functions: expression/formula, table, cube, map, logical and functional schema, graph.

3.Combinatorial and sequential logic nets. Huffman's schema.

4.Minimization of expressions for combinatorial logical nets with one and more outputs. Normalized expressions, disjunctive and conjunctive forms.

5.Minimization based on operations of Bool's algebra in expressions, in a unit cube.

6.Minimization based on operations of Bool's algebra in a truth table (Quin-McCluskey's method), in a logic map - Karnaugh's maps.

7.Combinatorial logical terms, circuits and blocks. Synthesis of combinatorial logic circuits NOT, AND, OR, NAND, NOR.

8.Synthesis of combinatorial logic circuits with limited number of inputs.

9.Modeling of sequential behavior. Finite automata: Mealy and Moore automata.

10.Memory circuits. Analysis and synthesis of synchronized sequential nets. Asynchronous sequential logic nets.

11.Predicate logic (PL): language, terms, formula, substitution and basic syntactic terms.

12.Semantics: structures for predicate logic, evaluation, evaluation of terms and formulas.

13.Axiomatic system of PL: axioms, inference rules, concept of a proof, reasoning theorem.

Syllabus of tutorials:

1.Logic system, logic circuit, logic function. Bool's algebra.

2.Representation (models) of logic functions: expression/formula, table, cube, map, logical and functional schema, graph.

3.Combinatorial and sequential logic nets. Huffman's schema.

4.Minimization of expressions for combinatorial logical nets with one and more outputs. Normalized expressions, disjunctive and conjunctive forms.

5.Minimization based on operations of Bool's algebra in expressions, in a unit cube.

6.Minimization based on operations of Bool's algebra in a truth table (Quin-McCluskey's method), in a logic map - Karnaugh's maps.

7.Combinatorial logical terms, circuits and blocks. Synthesis of combinatorial logic circuits NOT, AND, OR, NAND, NOR.

8.Synthesis of combinatorial logic circuits with limited number of inputs.

9.Modeling of sequential behavior. Finite automata: Mealy and Moore automata.

10.Memory circuits. Analysis and synthesis of synchronized sequential nets. Asynchronous sequential logic nets.

11.Predicate logic (PL): language, terms, formula, substitution and basic syntactic terms.

12.Semantics: structures for predicate logic, evaluation, evaluation of terms and formulas.

13.Axiomatic system of PL: axioms, inference rules, concept of a proof, reasoning theorem.

Study Objective:

The aim of the subject is to provide students with basics of logic, Bool's algebra, synthesis of logic circuits, finite automata and basics of predicate logics.

Study materials:

[1] Gensler H.: Introduction to Logic, Routledge, ISBN-13: 978-0415226752, 2001.

[2] Gajski D. D.: Principles of Digital Design. Prentice-Hall International, Inc. 1997.

[3] Wakerly, J. F.: Digital Design. Principles and Practices. Pearson Prentice Hall, New Jersey 2006.

[4] De Micheli G.: Synthesis and Optimization of Digital Circuits, McGraw-Hill Science, ISBN-13: 978-0070163331, 1994.

Note:
Time-table for winter semester 2018/2019:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Fri
roomKL:B-420_N
Brechlerová D.
10:00–11:50
(lecture parallel1)
Kladno FBMI
Učebna
roomKL:B-537_N
Brechlerová D.
12:00–13:50
(lecture parallel1
parallel nr.1)

Kladno FBMI
Učebna
Thu
Fri
Time-table for summer semester 2018/2019:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2019-08-22
For updated information see http://bilakniha.cvut.cz/en/predmet2787706.html