Logic as a Tool Chapter 2: Deductive Reasoning in Propositional - - PowerPoint PPT Presentation

▶
logic as a tool chapter 2 deductive reasoning in
SMART_READER_LITE
LIVE PREVIEW

Logic as a Tool Chapter 2: Deductive Reasoning in Propositional - - PowerPoint PPT Presentation

Nov 19, 2022 870 likes •1.16k views

Logic as a Tool Chapter 2: Deductive Reasoning in Propositional Logic 2.1 Logical Deductive Systems: an overview Valentin Goranko Stockholm University October 2016 Goranko Deductive systems Goranko Deductive systems Logical consequence:

slide-1
SLIDE 1

Goranko

Logic as a Tool Chapter 2: Deductive Reasoning in Propositional Logic 2.1 Logical Deductive Systems: an overview

Valentin Goranko Stockholm University October 2016

slide-2
SLIDE 2

Goranko

Deductive systems

slide-3
SLIDE 3

Goranko

Deductive systems

  • Logical consequence:

A1, . . . , An C

slide-4
SLIDE 4

Goranko

Deductive systems

  • Logical consequence:

A1, . . . , An C and logical validity: C are semantic notions, referring to the meaning of the formulae.

slide-5
SLIDE 5

Goranko

Deductive systems

  • Logical consequence:

A1, . . . , An C and logical validity: C are semantic notions, referring to the meaning of the formulae.

  • Deductive systems are meant to capture logical consequence and

validity defined by the logical semantics, in terms of deductions (derivations).

slide-6
SLIDE 6

Goranko

Deductive systems

  • Logical consequence:

A1, . . . , An C and logical validity: C are semantic notions, referring to the meaning of the formulae.

  • Deductive systems are meant to capture logical consequence and

validity defined by the logical semantics, in terms of deductions (derivations).

  • A deduction is a completely mechanical procedure, not referring to

the meaning of the occurring formulae.

slide-7
SLIDE 7

Goranko

Deductive systems

  • Logical consequence:

A1, . . . , An C and logical validity: C are semantic notions, referring to the meaning of the formulae.

  • Deductive systems are meant to capture logical consequence and

validity defined by the logical semantics, in terms of deductions (derivations).

  • A deduction is a completely mechanical procedure, not referring to

the meaning of the occurring formulae.

  • In deductive systems logical consequence is replaced by deductive

consequence and valid formulae (tautologies) – by derivable formulae (theorems).

slide-8
SLIDE 8

Goranko

Basic ingredients of a deductive system

slide-9
SLIDE 9

Goranko

Basic ingredients of a deductive system

  • Formal logical language. Formulae.
slide-10
SLIDE 10

Goranko

Basic ingredients of a deductive system

  • Formal logical language. Formulae.
  • Axioms. Rules of inference.
slide-11
SLIDE 11

Goranko

Basic ingredients of a deductive system

  • Formal logical language. Formulae.
  • Axioms. Rules of inference.
  • Inference (deduction, derivation) from a set of assumptions

(premisses) in a deductive system D: A1, . . . , An ⊢D C.

slide-12
SLIDE 12

Goranko

Basic ingredients of a deductive system

  • Formal logical language. Formulae.
  • Axioms. Rules of inference.
  • Inference (deduction, derivation) from a set of assumptions

(premisses) in a deductive system D: A1, . . . , An ⊢D C.

  • In particular, formulae derivable from no assumptions are called

theorems of D: ⊢D C.

slide-13
SLIDE 13

Goranko

Soundness and completeness of a deductive system

slide-14
SLIDE 14

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid),

slide-15
SLIDE 15

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C

slide-16
SLIDE 16

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C

slide-17
SLIDE 17

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C A deductive system D is complete for a given logical semantics if D can derive every valid logical consequence,

slide-18
SLIDE 18

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C A deductive system D is complete for a given logical semantics if D can derive every valid logical consequence, i.e.: A1, . . . , An C = ⇒ A1, . . . , An ⊢D C

slide-19
SLIDE 19

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C A deductive system D is complete for a given logical semantics if D can derive every valid logical consequence, i.e.: A1, . . . , An C = ⇒ A1, . . . , An ⊢D C In particular: C = ⇒ ⊢D C

slide-20
SLIDE 20

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C A deductive system D is complete for a given logical semantics if D can derive every valid logical consequence, i.e.: A1, . . . , An C = ⇒ A1, . . . , An ⊢D C In particular: C = ⇒ ⊢D C A deductive system D is adequate for a given semantics if it is both sound and complete for it,

slide-21
SLIDE 21

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C A deductive system D is complete for a given logical semantics if D can derive every valid logical consequence, i.e.: A1, . . . , An C = ⇒ A1, . . . , An ⊢D C In particular: C = ⇒ ⊢D C A deductive system D is adequate for a given semantics if it is both sound and complete for it, i.e.: A1, . . . , An C ⇐ ⇒ A1, . . . , An ⊢D C

slide-22
SLIDE 22

Goranko

Soundness and completeness of a deductive system

A deductive system D is sound (correct) for a given logical semantics if D can only derive what is logically correct (valid), i.e.: A1, . . . , An ⊢D C = ⇒ A1, . . . , An C In particular: ⊢D C = ⇒ C A deductive system D is complete for a given logical semantics if D can derive every valid logical consequence, i.e.: A1, . . . , An C = ⇒ A1, . . . , An ⊢D C In particular: C = ⇒ ⊢D C A deductive system D is adequate for a given semantics if it is both sound and complete for it, i.e.: A1, . . . , An C ⇐ ⇒ A1, . . . , An ⊢D C In particular: C ⇐ ⇒ ⊢D C.

slide-23
SLIDE 23

Goranko

Main types of classical deductive systems

slide-24
SLIDE 24

Goranko

Main types of classical deductive systems

  • Axiomatic systems
slide-25
SLIDE 25

Goranko

Main types of classical deductive systems

  • Axiomatic systems
  • Natural deduction
slide-26
SLIDE 26

Goranko

Main types of classical deductive systems

  • Axiomatic systems
  • Natural deduction
  • Semantic tableaux
slide-27
SLIDE 27

Goranko

Main types of classical deductive systems

  • Axiomatic systems
  • Natural deduction
  • Semantic tableaux
  • Sequent calculi
slide-28
SLIDE 28

Goranko

Main types of classical deductive systems

  • Axiomatic systems
  • Natural deduction
  • Semantic tableaux
  • Sequent calculi
  • Resolution