22.06.2013 Views

Handbook of the History of Logic: - Fordham University Faculty

Handbook of the History of Logic: - Fordham University Faculty

Handbook of the History of Logic: - Fordham University Faculty

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

430 Gyula Klima<br />

in which <strong>the</strong> object language is capable <strong>of</strong> “cannibalizing” its own meta-language,<br />

by introducing distinguished semantic predicates into <strong>the</strong> object-language matching<br />

those originally defined in <strong>the</strong> meta-language.<br />

The pay<strong>of</strong>f <strong>of</strong> such a project would be <strong>the</strong> ability to see exactly what it takes, in<br />

precise model-<strong>the</strong>oretical terms, to construct a nominalist semantics, facilitating<br />

its comparison both with <strong>the</strong> competing medieval conception and with a number<br />

<strong>of</strong> modern conceptions. And this, in <strong>the</strong> end, might just get us closer to a genuine<br />

understanding <strong>of</strong> <strong>the</strong> fundamental semantic relations between language, thought<br />

and reality.<br />

Language<br />

APPENDIX<br />

L := 〈C, P, V, Trm, F〉 [language : constants, parameters, variables, terms, formulae]<br />

C := { ∼, &, =, ∀,.,(, )} [constants: negation, conjunction, identity, universal<br />

quantifier, punctuation marks]<br />

P := Pr∪I,Pr := ∪{F m n },I := ∪{an} [parameters: predicates, individual names]<br />

V := X ∪ Xr,X := ∪{xi}, [variables: simple variables plus restricted variables]<br />

Xr := {tn : tn =‘x.A’ andA ∈ F } [restricted variable: formula prefixed with<br />

simple variable and dot]<br />

Trm:=I∪V [terms: individual names plus variables]<br />

Formulae:<br />

1. t1...tm ∈ Trm, F m n ∈ Pr → ‘F m n (t1)...(tm)’ ∈ F<br />

2. t1,t2 ∈ Trm → ‘t1 = t2’ ∈ F<br />

3. A, B ∈ F → ‘∼ (A)’, ‘A&B’ ∈ F<br />

4. A ∈ F, v ∈ V → ‘(∀v)(A)’ ∈ F<br />

Model<br />

M := 〈D, T, E, 0, 1,SGT〉, where<br />

D = ∅,T = ∅,t ∈ T,E(t) ⊂ D, 0 /∈ D, 1 /∈ D, SGT : P → D ∪ P (D m ) [non-empty<br />

domain, set <strong>of</strong> times, times, set <strong>of</strong> existents at time t, 0 and 1: False and True,<br />

signification function: from parameters to <strong>the</strong> domain plus <strong>the</strong> power-set <strong>of</strong> <strong>the</strong><br />

m-th Cartesian product <strong>of</strong> D with itself]<br />

1. SGT(an) ∈ D<br />

2. SGT(F m n ) ∈ P (D m )

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!