Does relative interpretation preserve meaning? Mirko Engler Dept. - - PowerPoint PPT Presentation

does relative interpretation preserve meaning
SMART_READER_LITE
LIVE PREVIEW

Does relative interpretation preserve meaning? Mirko Engler Dept. - - PowerPoint PPT Presentation

Does relative interpretation preserve meaning? Mirko Engler Dept. of Philosophy, HU Berlin & Dept. of Mathematics, U Nova Lisboa PhDs in Logic X Prague, May 2, 2018 This work is supported by the Portuguese Science Foundation, FCT,


slide-1
SLIDE 1

Does relative interpretation preserve meaning?

Mirko Engler

  • Dept. of Philosophy, HU Berlin & Dept. of Mathematics, U Nova Lisboa

PhD’s in Logic X

Prague, May 2, 2018

This work is supported by the Portuguese Science Foundation, FCT, through the project PTDC/MHC-FIL/2583/2014. Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 1 / 17

slide-2
SLIDE 2

Introduction

relative interpretations had become a useful tool in comparing theories in mathematical logic

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 2 / 17

slide-3
SLIDE 3

Introduction

relative interpretations had become a useful tool in comparing theories in mathematical logic a lot of important properties of a theory are preserved

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 2 / 17

slide-4
SLIDE 4

Introduction

relative interpretations had become a useful tool in comparing theories in mathematical logic a lot of important properties of a theory are preserved what can we say about preserving the meaning of a theory?

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 2 / 17

slide-5
SLIDE 5

Introduction

relative interpretations had become a useful tool in comparing theories in mathematical logic a lot of important properties of a theory are preserved what can we say about preserving the meaning of a theory? we state two thesis of preservation of meaning

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 2 / 17

slide-6
SLIDE 6

Introduction

relative interpretations had become a useful tool in comparing theories in mathematical logic a lot of important properties of a theory are preserved what can we say about preserving the meaning of a theory? we state two thesis of preservation of meaning we consider the interpretability of inconsistency

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 2 / 17

slide-7
SLIDE 7

Introduction

relative interpretations had become a useful tool in comparing theories in mathematical logic a lot of important properties of a theory are preserved what can we say about preserving the meaning of a theory? we state two thesis of preservation of meaning we consider the interpretability of inconsistency meaning of theory is not in generel preserved by rel. interpretations

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 2 / 17

slide-8
SLIDE 8

Overview

1

Relative Interpretation Definitions Examples Basic Principles

2

Preservation of Meaning Meaning and Interpretation Preservation of Meaning

3

A Counterexample Expressing Inconsistency Feferman’s Theorem A Counterexample

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 3 / 17

slide-9
SLIDE 9

Definitions

Let L[S] and L[T] be languages of 1st order theories S and T with identity.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 4 / 17

slide-10
SLIDE 10

Definitions

Let L[S] and L[T] be languages of 1st order theories S and T with identity.

Definition (Relative Translation)

A relative translation f for L[S] to L[T] is given by a pair I, δ, where I : L[S] → L[T] assigning every n-ary P of L[S] injectively to a n-ary formula of L[T] and δ(x) is a formula of L[T] with one free variable different to all I(P), satisfying the following conditions:

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 4 / 17

slide-11
SLIDE 11

Definitions

Let L[S] and L[T] be languages of 1st order theories S and T with identity.

Definition (Relative Translation)

A relative translation f for L[S] to L[T] is given by a pair I, δ, where I : L[S] → L[T] assigning every n-ary P of L[S] injectively to a n-ary formula of L[T] and δ(x) is a formula of L[T] with one free variable different to all I(P), satisfying the following conditions: f (vn = vm) ˙ = (vn = vm) for all n, m ∈ N f (Pvi1...vin) ˙ = I(P)(vi1...vin) for all n-ary predicatsymbols P of L[S] f (¬ϕ) ˙ = ¬f (ϕ) and f (ϕ → ψ) ˙ = f (ϕ) → f (ψ) for all ϕ, ψ of L[S] f (∀vnϕ) ˙ = ∀vn(δ(vn) → f (ϕ)) for all ϕ of L[S] and all n ∈ N

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 4 / 17

slide-12
SLIDE 12

Definitions

Let L[S] and L[T] be languages of 1st order theories S and T with identity.

Definition (Relative Translation)

A relative translation f for L[S] to L[T] is given by a pair I, δ, where I : L[S] → L[T] assigning every n-ary P of L[S] injectively to a n-ary formula of L[T] and δ(x) is a formula of L[T] with one free variable different to all I(P), satisfying the following conditions: f (vn = vm) ˙ = (vn = vm) for all n, m ∈ N f (Pvi1...vin) ˙ = I(P)(vi1...vin) for all n-ary predicatsymbols P of L[S] f (¬ϕ) ˙ = ¬f (ϕ) and f (ϕ → ψ) ˙ = f (ϕ) → f (ψ) for all ϕ, ψ of L[S] f (∀vnϕ) ˙ = ∀vn(δ(vn) → f (ϕ)) for all ϕ of L[S] and all n ∈ N If f is a relative translation for L[S] to L[T], we write TrlL[S]

L[T](f ).

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 4 / 17

slide-13
SLIDE 13

Definitions

Definition (Relative Interpretation)

Let TrlL[S]

L[T](f ); we define f is a relative interpretation of S in T (S ≺f T)

and f is a relative faithful interpretation of S in T (S f T) as follows:

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 5 / 17

slide-14
SLIDE 14

Definitions

Definition (Relative Interpretation)

Let TrlL[S]

L[T](f ); we define f is a relative interpretation of S in T (S ≺f T)

and f is a relative faithful interpretation of S in T (S f T) as follows: S ≺f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇒ T ⊢ f (ϕ))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 5 / 17

slide-15
SLIDE 15

Definitions

Definition (Relative Interpretation)

Let TrlL[S]

L[T](f ); we define f is a relative interpretation of S in T (S ≺f T)

and f is a relative faithful interpretation of S in T (S f T) as follows: S ≺f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇒ T ⊢ f (ϕ)) S f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇔ T ⊢ f (ϕ))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 5 / 17

slide-16
SLIDE 16

Definitions

Definition (Relative Interpretation)

Let TrlL[S]

L[T](f ); we define f is a relative interpretation of S in T (S ≺f T)

and f is a relative faithful interpretation of S in T (S f T) as follows: S ≺f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇒ T ⊢ f (ϕ)) S f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇔ T ⊢ f (ϕ)) If there exists a f s.t S ≺f T (resp. S f T) we simply write S ≺ T (resp. S T) and speak of rel. interpretability (resp. rel. faithful interpretability) simpliciter.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 5 / 17

slide-17
SLIDE 17

Definitions

Definition (Relative Interpretation)

Let TrlL[S]

L[T](f ); we define f is a relative interpretation of S in T (S ≺f T)

and f is a relative faithful interpretation of S in T (S f T) as follows: S ≺f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇒ T ⊢ f (ϕ)) S f T : ⇔ ∀ϕ(ϕ ∈ SentL[S] ⇒ (S ⊢ ϕ ⇔ T ⊢ f (ϕ)) If there exists a f s.t S ≺f T (resp. S f T) we simply write S ≺ T (resp. S T) and speak of rel. interpretability (resp. rel. faithful interpretability) simpliciter. If S ≺ T and T ≺ S (resp. S T and T S) we write S ∼ T (resp. S ≃ T) and speak of mutual (faithful) interpretability.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 5 / 17

slide-18
SLIDE 18

Examples

PA ≺ ZF

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-19
SLIDE 19

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-20
SLIDE 20

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF Hyperbolic Geometry H ≺ RCF

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-21
SLIDE 21

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF Hyperbolic Geometry H ≺ RCF Robinson Arithmetic Q ≺ First-order Group Theory

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-22
SLIDE 22

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF Hyperbolic Geometry H ≺ RCF Robinson Arithmetic Q ≺ First-order Group Theory PA + ¬Conpa ≺ PA

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-23
SLIDE 23

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF Hyperbolic Geometry H ≺ RCF Robinson Arithmetic Q ≺ First-order Group Theory PA + ¬Conpa ≺ PA , but PA + Conpa ≺ PA

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-24
SLIDE 24

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF Hyperbolic Geometry H ≺ RCF Robinson Arithmetic Q ≺ First-order Group Theory PA + ¬Conpa ≺ PA , but PA + Conpa ≺ PA ZF + GCH + AC ∼ ZF

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-25
SLIDE 25

Examples

PA ≺ ZF Euclidian Geometry P ≺ RCF Hyperbolic Geometry H ≺ RCF Robinson Arithmetic Q ≺ First-order Group Theory PA + ¬Conpa ≺ PA , but PA + Conpa ≺ PA ZF + GCH + AC ∼ ZF ZF + ¬CH + ¬AC ∼ ZF

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 6 / 17

slide-26
SLIDE 26

Basic Principles: Some Preservation Results

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 7 / 17

slide-27
SLIDE 27

Basic Principles: Some Preservation Results

Preservation of Consistency (backwards)

S ≺ T ⇒ (T consistent ⇒ S consistent)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 7 / 17

slide-28
SLIDE 28

Basic Principles: Some Preservation Results

Preservation of Consistency (backwards)

S ≺ T ⇒ (T consistent ⇒ S consistent)

Preservation of Undecidability

S ≺ T ⇒ (S undecidable ⇒ T undecidable)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 7 / 17

slide-29
SLIDE 29

Basic Principles: Some Preservation Results

Preservation of Consistency (backwards)

S ≺ T ⇒ (T consistent ⇒ S consistent)

Preservation of Undecidability

S ≺ T ⇒ (S undecidable ⇒ T undecidable)

Preservation of Decidability (backwards)

S T ⇒ (T decidable ⇒ S decidable)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 7 / 17

slide-30
SLIDE 30

Basic Principles: Some Preservation Results

Preservation of Consistency (backwards)

S ≺ T ⇒ (T consistent ⇒ S consistent)

Preservation of Undecidability

S ≺ T ⇒ (S undecidable ⇒ T undecidable)

Preservation of Decidability (backwards)

S T ⇒ (T decidable ⇒ S decidable)

Preservation of Provability for Π0

1-sentences

S ≺ T ⇔ S ⊆Π0

1 T

for S, T ⊇ PA

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 7 / 17

slide-31
SLIDE 31

Basic Principles: Some Preservation Results

Preservation of Consistency (backwards)

S ≺ T ⇒ (T consistent ⇒ S consistent)

Preservation of Undecidability

S ≺ T ⇒ (S undecidable ⇒ T undecidable)

Preservation of Decidability (backwards)

S T ⇒ (T decidable ⇒ S decidable)

Preservation of Provability for Π0

1-sentences

S ≺ T ⇔ S ⊆Π0

1 T

for S, T ⊇ PA

Preservation of Provability for Σ0

1-sentences (backwards)

S T ⇒ T ⊆Σ0

1 S

for S, T ⊇ PA

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 7 / 17

slide-32
SLIDE 32

Meaning and Interpretation

Question: Does relative (faithful) interpretation also preserve meaning?

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 8 / 17

slide-33
SLIDE 33

Meaning and Interpretation

Question: Does relative (faithful) interpretation also preserve meaning? Pro: Meaning is use. Use (in mathematics) is proof. Relative interpretation preserves provability (modulo translation). (C. Wright)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 8 / 17

slide-34
SLIDE 34

Meaning and Interpretation

Question: Does relative (faithful) interpretation also preserve meaning? Pro: Meaning is use. Use (in mathematics) is proof. Relative interpretation preserves provability (modulo translation). (C. Wright) Relative Interpretation is a conceptual reduction of theories. (S. Feferman)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 8 / 17

slide-35
SLIDE 35

Meaning and Interpretation

Question: Does relative (faithful) interpretation also preserve meaning? Pro: Meaning is use. Use (in mathematics) is proof. Relative interpretation preserves provability (modulo translation). (C. Wright) Relative Interpretation is a conceptual reduction of theories. (S. Feferman) Contra: Against mathematical practice. (A. Arana) (S. Walsh)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 8 / 17

slide-36
SLIDE 36

Meaning and Interpretation

Question: Does relative (faithful) interpretation also preserve meaning? Pro: Meaning is use. Use (in mathematics) is proof. Relative interpretation preserves provability (modulo translation). (C. Wright) Relative Interpretation is a conceptual reduction of theories. (S. Feferman) Contra: Against mathematical practice. (A. Arana) (S. Walsh) Let’s try to prove or disprove a formal preservation result!

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 8 / 17

slide-37
SLIDE 37

Meaning and Interpretation

Let E(ϕ, S, Φ) abbreviate the relation ϕ expresses Φ relative to a r.e. consistent theory S.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 9 / 17

slide-38
SLIDE 38

Meaning and Interpretation

Let E(ϕ, S, Φ) abbreviate the relation ϕ expresses Φ relative to a r.e. consistent theory S. Let E(ϕ, S, Φ) be axiomatized, inter alia, by the following principles, where S ⊆ T are r.e. consistent theories. E(ϕ, S, Φ) ⇒ E(ϕ, T, Φ)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 9 / 17

slide-39
SLIDE 39

Meaning and Interpretation

Let E(ϕ, S, Φ) abbreviate the relation ϕ expresses Φ relative to a r.e. consistent theory S. Let E(ϕ, S, Φ) be axiomatized, inter alia, by the following principles, where S ⊆ T are r.e. consistent theories. E(ϕ, S, Φ) ⇒ E(ϕ, T, Φ) E(ϕ, S, ∅), if ϕ is a tautology

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 9 / 17

slide-40
SLIDE 40

Meaning and Interpretation

Let E(ϕ, S, Φ) abbreviate the relation ϕ expresses Φ relative to a r.e. consistent theory S. Let E(ϕ, S, Φ) be axiomatized, inter alia, by the following principles, where S ⊆ T are r.e. consistent theories. E(ϕ, S, Φ) ⇒ E(ϕ, T, Φ) E(ϕ, S, ∅), if ϕ is a tautology E(ϕ, S, ∅) ⇒ E(f (ϕ), T, ∅)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 9 / 17

slide-41
SLIDE 41

Meaning and Interpretation

Let E(ϕ, S, Φ) abbreviate the relation ϕ expresses Φ relative to a r.e. consistent theory S. Let E(ϕ, S, Φ) be axiomatized, inter alia, by the following principles, where S ⊆ T are r.e. consistent theories. E(ϕ, S, Φ) ⇒ E(ϕ, T, Φ) E(ϕ, S, ∅), if ϕ is a tautology E(ϕ, S, ∅) ⇒ E(f (ϕ), T, ∅)

Definition (Conceptual Embedding)

Let S and T be r.e consistent theories and TrlL[S]

L[T](f ):

S ֒ →f T : ⇔ ∀ϕΦ(ϕ ∈ SentL[S] ⇒ (E(ϕ, S, Φ) ⇒ E(f (ϕ), T, Φ))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 9 / 17

slide-42
SLIDE 42

Two Thesis’ of Preservation of Meaning

Thesis 1 (Preservation of Meaning [strong])

Let S, T be r.e. consistent theories, then ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 10 / 17

slide-43
SLIDE 43

Two Thesis’ of Preservation of Meaning

Thesis 1 (Preservation of Meaning [strong])

Let S, T be r.e. consistent theories, then ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) Let S = FOL, then for any f and T: S ֒ →f T

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 10 / 17

slide-44
SLIDE 44

Two Thesis’ of Preservation of Meaning

Thesis 1 (Preservation of Meaning [strong])

Let S, T be r.e. consistent theories, then ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) Let S = FOL, then for any f and T: S ֒ →f T

Thesis 2 (Preservation of Meaning [weak])

Let S, T be r.e. consistent theories, then S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 10 / 17

slide-45
SLIDE 45

Two Thesis’ of Preservation of Meaning

Thesis 1 (Preservation of Meaning [strong])

Let S, T be r.e. consistent theories, then ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) Let S = FOL, then for any f and T: S ֒ →f T

Thesis 2 (Preservation of Meaning [weak])

Let S, T be r.e. consistent theories, then S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T) Let T = S, then for f = f=: S ≺f T ∧ S ֒ →f T

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 10 / 17

slide-46
SLIDE 46

Two Thesis’ of Preservation of Meaning

Thesis 1 (Preservation of Meaning [strong])

Let S, T be r.e. consistent theories, then ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) Let S = FOL, then for any f and T: S ֒ →f T

Thesis 2 (Preservation of Meaning [weak])

Let S, T be r.e. consistent theories, then S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T) Let T = S, then for f = f=: S ≺f T ∧ S ֒ →f T Note: Thesis 1 ⇒ Thesis 2.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 10 / 17

slide-47
SLIDE 47

Expressing Provability and (In-)Consistency

Let S and T be a r.e. consistent extensions of PA in L[PA].

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 11 / 17

slide-48
SLIDE 48

Expressing Provability and (In-)Consistency

Let S and T be a r.e. consistent extensions of PA in L[PA].

Condition 1 (Expressing Provability)

Let Proof (T) ⊆ N × N s.t. n, ϕ ∈ Proof (T) ⇔ n codes a proof of ϕ in T. If the formula P(x) := ∃yτ(y, x) expresses T-provability in S, then

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 11 / 17

slide-49
SLIDE 49

Expressing Provability and (In-)Consistency

Let S and T be a r.e. consistent extensions of PA in L[PA].

Condition 1 (Expressing Provability)

Let Proof (T) ⊆ N × N s.t. n, ϕ ∈ Proof (T) ⇔ n codes a proof of ϕ in T. If the formula P(x) := ∃yτ(y, x) expresses T-provability in S, then N | = τ(n, ϕ) ⇔ n, ϕ ∈ Proof (T) with τ ∈ ∆0

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 11 / 17

slide-50
SLIDE 50

Expressing Provability and (In-)Consistency

Let S and T be a r.e. consistent extensions of PA in L[PA].

Condition 1 (Expressing Provability)

Let Proof (T) ⊆ N × N s.t. n, ϕ ∈ Proof (T) ⇔ n codes a proof of ϕ in T. If the formula P(x) := ∃yτ(y, x) expresses T-provability in S, then N | = τ(n, ϕ) ⇔ n, ϕ ∈ Proof (T) with τ ∈ ∆0 S ⊢ ϕ → P(ϕ) for ϕ ∈ Σ0

1

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 11 / 17

slide-51
SLIDE 51

Expressing Provability and (In-)Consistency

Let S and T be a r.e. consistent extensions of PA in L[PA].

Condition 1 (Expressing Provability)

Let Proof (T) ⊆ N × N s.t. n, ϕ ∈ Proof (T) ⇔ n codes a proof of ϕ in T. If the formula P(x) := ∃yτ(y, x) expresses T-provability in S, then N | = τ(n, ϕ) ⇔ n, ϕ ∈ Proof (T) with τ ∈ ∆0 S ⊢ ϕ → P(ϕ) for ϕ ∈ Σ0

1

S ⊢ P(ϕ → ψ) → (P(ϕ) → P(ψ))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 11 / 17

slide-52
SLIDE 52

Expressing Provability and (In-)Consistency

Let S and T be a r.e. consistent extensions of PA in L[PA].

Condition 1 (Expressing Provability)

Let Proof (T) ⊆ N × N s.t. n, ϕ ∈ Proof (T) ⇔ n codes a proof of ϕ in T. If the formula P(x) := ∃yτ(y, x) expresses T-provability in S, then N | = τ(n, ϕ) ⇔ n, ϕ ∈ Proof (T) with τ ∈ ∆0 S ⊢ ϕ → P(ϕ) for ϕ ∈ Σ0

1

S ⊢ P(ϕ → ψ) → (P(ϕ) → P(ψ))

Condition 2 (Expressing Inconsistency)

If ϕ expresses the inconsistency of T in S, then S ⊢ ϕ ↔ P(⊥), for a formula P(x) expressing T-provability in S.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 11 / 17

slide-53
SLIDE 53

Expressing Provability and (In-)Consistency

Let S be a r.e. consistent extension of PA in L[PA] and T a r.e. theory in L[PA] extending S.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 12 / 17

slide-54
SLIDE 54

Expressing Provability and (In-)Consistency

Let S be a r.e. consistent extension of PA in L[PA] and T a r.e. theory in L[PA] extending S.

Lemma 1 (Hilbert-Bernays-Löb Conditions)

If P(x) expresses T-provability in S, then T ⊢ ϕ ⇒ S ⊢ P(ϕ)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 12 / 17

slide-55
SLIDE 55

Expressing Provability and (In-)Consistency

Let S be a r.e. consistent extension of PA in L[PA] and T a r.e. theory in L[PA] extending S.

Lemma 1 (Hilbert-Bernays-Löb Conditions)

If P(x) expresses T-provability in S, then T ⊢ ϕ ⇒ S ⊢ P(ϕ) S ⊢ P(ϕ) → P(P(ϕ)))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 12 / 17

slide-56
SLIDE 56

Expressing Provability and (In-)Consistency

Let S be a r.e. consistent extension of PA in L[PA] and T a r.e. theory in L[PA] extending S.

Lemma 1 (Hilbert-Bernays-Löb Conditions)

If P(x) expresses T-provability in S, then T ⊢ ϕ ⇒ S ⊢ P(ϕ) S ⊢ P(ϕ) → P(P(ϕ))) S is ω-consistent ⇒ (S ⊢ P(ϕ) ⇒ T ⊢ ϕ)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 12 / 17

slide-57
SLIDE 57

Expressing Provability and (In-)Consistency

Let S be a r.e. consistent extension of PA in L[PA] and T a r.e. theory in L[PA] extending S.

Lemma 1 (Hilbert-Bernays-Löb Conditions)

If P(x) expresses T-provability in S, then T ⊢ ϕ ⇒ S ⊢ P(ϕ) S ⊢ P(ϕ) → P(P(ϕ))) S is ω-consistent ⇒ (S ⊢ P(ϕ) ⇒ T ⊢ ϕ)

Lemma 2 (Löb’s Theorem)

If P(x) expresses T-provability in S, then S ⊢ P(P(ϕ) → ϕ) → P(ϕ)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 12 / 17

slide-58
SLIDE 58

Feferman’s Theorem

We already know that PA + ¬Conpa ≺ PA (Feferman).

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 13 / 17

slide-59
SLIDE 59

Feferman’s Theorem

We already know that PA + ¬Conpa ≺ PA (Feferman). By using Condition 1, 2 and Lemma 1, 2 we can prove:

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 13 / 17

slide-60
SLIDE 60

Feferman’s Theorem

We already know that PA + ¬Conpa ≺ PA (Feferman). By using Condition 1, 2 and Lemma 1, 2 we can prove:

Theorem (Interpretability of Inconsistency)

Let T be a consistent, r.e. extension of PA and ψ a L[PA]-sentence. If ψ expresses the inconsistency of T in T, then T + ψ ≺ T.

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 13 / 17

slide-61
SLIDE 61

Feferman’s Theorem

We already know that PA + ¬Conpa ≺ PA (Feferman). By using Condition 1, 2 and Lemma 1, 2 we can prove:

Theorem (Interpretability of Inconsistency)

Let T be a consistent, r.e. extension of PA and ψ a L[PA]-sentence. If ψ expresses the inconsistency of T in T, then T + ψ ≺ T. This version of Feferman’s Theorem is generalization in two important aspects:

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 13 / 17

slide-62
SLIDE 62

Feferman’s Theorem

We already know that PA + ¬Conpa ≺ PA (Feferman). By using Condition 1, 2 and Lemma 1, 2 we can prove:

Theorem (Interpretability of Inconsistency)

Let T be a consistent, r.e. extension of PA and ψ a L[PA]-sentence. If ψ expresses the inconsistency of T in T, then T + ψ ≺ T. This version of Feferman’s Theorem is generalization in two important aspects: it holds for all sentences expressing inconsistency

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 13 / 17

slide-63
SLIDE 63

Feferman’s Theorem

We already know that PA + ¬Conpa ≺ PA (Feferman). By using Condition 1, 2 and Lemma 1, 2 we can prove:

Theorem (Interpretability of Inconsistency)

Let T be a consistent, r.e. extension of PA and ψ a L[PA]-sentence. If ψ expresses the inconsistency of T in T, then T + ψ ≺ T. This version of Feferman’s Theorem is generalization in two important aspects: it holds for all sentences expressing inconsistency the proof does not rest on a specific relative translation f

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 13 / 17

slide-64
SLIDE 64

A Counterexample

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-65
SLIDE 65

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-66
SLIDE 66

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-67
SLIDE 67

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-68
SLIDE 68

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-69
SLIDE 69

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

5 E(f (ψ), PA, Incon(PA)) Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-70
SLIDE 70

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

5 E(f (ψ), PA, Incon(PA)) 6 PA ⊢ f (ψ) ↔ P(⊥) for P(x) expressing PA-provability in PA Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-71
SLIDE 71

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

5 E(f (ψ), PA, Incon(PA)) 6 PA ⊢ f (ψ) ↔ P(⊥) for P(x) expressing PA-provability in PA 7 PA ⊢ f (ψ) Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-72
SLIDE 72

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

5 E(f (ψ), PA, Incon(PA)) 6 PA ⊢ f (ψ) ↔ P(⊥) for P(x) expressing PA-provability in PA 7 PA ⊢ f (ψ) 8 PA ⊢ P(⊥) Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-73
SLIDE 73

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

5 E(f (ψ), PA, Incon(PA)) 6 PA ⊢ f (ψ) ↔ P(⊥) for P(x) expressing PA-provability in PA 7 PA ⊢ f (ψ) 8 PA ⊢ P(⊥) 9 PA ⊢ ⊥, so Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-74
SLIDE 74

A Counterexample

1 Assume there is a ψ in L[PA] s.t E(ψ, PA, Incon(PA)) 2 PA +ψ ≺ PA 3 E(ψ, PA +ψ, Incon(PA)) 4 Assume PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

5 E(f (ψ), PA, Incon(PA)) 6 PA ⊢ f (ψ) ↔ P(⊥) for P(x) expressing PA-provability in PA 7 PA ⊢ f (ψ) 8 PA ⊢ P(⊥) 9 PA ⊢ ⊥, so 10 PA +ψ ֒

→f PA, for any f s.t. PA +ψ ≺f PA

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 14 / 17

slide-75
SLIDE 75

A Counterexample

Lemma 3 (Conceptual Embeddings)

There are r.e. consistent theories S and T, such that S ≺ T and ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T))

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 15 / 17

slide-76
SLIDE 76

A Counterexample

Lemma 3 (Conceptual Embeddings)

There are r.e. consistent theories S and T, such that S ≺ T and ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) disproves Thesis 2 (S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 15 / 17

slide-77
SLIDE 77

A Counterexample

Lemma 3 (Conceptual Embeddings)

There are r.e. consistent theories S and T, such that S ≺ T and ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) disproves Thesis 2 (S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T) disproves Thesis 1 (Thesis 1 ⇒ Thesis 2)

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 15 / 17

slide-78
SLIDE 78

A Counterexample

Lemma 3 (Conceptual Embeddings)

There are r.e. consistent theories S and T, such that S ≺ T and ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) disproves Thesis 2 (S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T) disproves Thesis 1 (Thesis 1 ⇒ Thesis 2) the same holds for instead of ≺

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 15 / 17

slide-79
SLIDE 79

A Counterexample

Lemma 3 (Conceptual Embeddings)

There are r.e. consistent theories S and T, such that S ≺ T and ∀f (TrlL[S]

L[T](f ) ⇒ (S ≺f T ⇒ S ֒

→f T)) disproves Thesis 2 (S ≺ T ⇒ ∃f (TrlL[S]

L[T](f ) ∧ S ≺f T ∧ S ֒

→f T) disproves Thesis 1 (Thesis 1 ⇒ Thesis 2) the same holds for instead of ≺ Question: Can we strengthen relative interpretation to preserve meaning?

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 15 / 17

slide-80
SLIDE 80

Thank you!

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 16 / 17

slide-81
SLIDE 81

Further Reading

  • A. Tarski, A. Mostowski, R.M. Robinson, Undecidable theories, Studies

in logic and the foundation of mathematics, North-Holland, 1953.

  • S. Feferman, Arithmetization of metamathematics in a general setting,

Fundamenta Mathematicae, vol. 49 (1960), no. 1, pp. 35 - 92.

  • S. Feferman, What rests on what? The proof-theoretic analysis of

mathematics, Philosophy of mathematics (J. Czermak, editor), Hoelder-Pichler-Tempsky, Wien, 1993, pp. 147 - 171.

  • A. Visser, Categories of theories and interpretations, Lecture Notes in

Logic (Logic in Teheran), (A. Enayat, I. Kalantari, M. Moniri, editors),

  • vol. 26, The Association for Symbolic Logic, 2006, pp. 284 - 341.
  • A. Arana, Meaning and interpretation in mathematics, Forthcoming

Mirko Engler (HU Berlin & UNL) Meaning & Interpretation Prague, May 2, 2018 17 / 17