- #1
microsansfil
- 325
- 43
Hello
Every physical theory is formulated in terms of mathematical objects. It is thus necessary to establish a set of rules to map physical concepts and objects into mathematical objects that we use to represent them.
http://ocw.mit.edu/courses/nuclear-...s-fall-2012/lecture-notes/MIT22_51F12_Ch3.pdf
Is there a relationship between this so-called axiomatic formulation and mathematical formulation in formal system ?
In mathematics :
Formal proofs are sequences of well-formed formulas. For a wff to qualify as part of a proof, it might either be an axiom or be the product of applying an inference rule on previous wffs in the proof sequence. The last wff in the sequence is recognized as a theorem.
Once a formal system is given, one can define the set of theorems which can be proved inside the formal system. This set consists of all wffs for which there is a proof.
In mathematics, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems
So far we have only talked about syntax
To give sense you need mathematical interpretation. In mathematics, model theory is the study of classes of mathematical structures (e.g. groups, fields, graphs, universes of set theory) from the perspective of mathematical logic. A theory is a set of sentences in a formal language, and model of a theory a structure (e.g. an interpretation) that satisfies the sentences of that theory.
For example let say F is the closed formula. F = ∀x ∀y (p(x,y) → ∃ z ( p(x,z) ∧ p(z,y) ) p is a predicate.
Noting G the implication F :∀x ∀y ( G )
1/ Interpretation I1 for domain D1 which is the set of real. The binary predicate p is the order <
if p (x, y) is false, G is true
if p (x, y) is true, then x <y. Let z = (x + y) / 2. Then, p (x, z) is true, and p (z, y) also
In conclusion, the formula F is satisfiable and I1 is a model for F.
2/ Interpretation I2 for domain D2 which is the set of natural numbers. The binary predicate p is still the order <
if p (x, y) is false, G is true
if p (x, y) is true, then x <y. There is no integer between x and y when x and y are consecutive. G may be false.
In conclusion F therefore is not valid as there are interpretations which do not satisfy F, but F is not unsatisfiable.In other words about this example, the same syntatic formula is undecidable in the theory of total order, then it is a theorem in the theory of dense orders.
A mathematical statement is written in a certain language, and we can say it is true or false in a structure that interprets all the language elements.
Patrick
Every physical theory is formulated in terms of mathematical objects. It is thus necessary to establish a set of rules to map physical concepts and objects into mathematical objects that we use to represent them.
http://ocw.mit.edu/courses/nuclear-...s-fall-2012/lecture-notes/MIT22_51F12_Ch3.pdf
Is there a relationship between this so-called axiomatic formulation and mathematical formulation in formal system ?
In mathematics :
Formal proofs are sequences of well-formed formulas. For a wff to qualify as part of a proof, it might either be an axiom or be the product of applying an inference rule on previous wffs in the proof sequence. The last wff in the sequence is recognized as a theorem.
Once a formal system is given, one can define the set of theorems which can be proved inside the formal system. This set consists of all wffs for which there is a proof.
In mathematics, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems
So far we have only talked about syntax
To give sense you need mathematical interpretation. In mathematics, model theory is the study of classes of mathematical structures (e.g. groups, fields, graphs, universes of set theory) from the perspective of mathematical logic. A theory is a set of sentences in a formal language, and model of a theory a structure (e.g. an interpretation) that satisfies the sentences of that theory.
For example let say F is the closed formula. F = ∀x ∀y (p(x,y) → ∃ z ( p(x,z) ∧ p(z,y) ) p is a predicate.
Noting G the implication F :∀x ∀y ( G )
1/ Interpretation I1 for domain D1 which is the set of real. The binary predicate p is the order <
if p (x, y) is false, G is true
if p (x, y) is true, then x <y. Let z = (x + y) / 2. Then, p (x, z) is true, and p (z, y) also
In conclusion, the formula F is satisfiable and I1 is a model for F.
2/ Interpretation I2 for domain D2 which is the set of natural numbers. The binary predicate p is still the order <
if p (x, y) is false, G is true
if p (x, y) is true, then x <y. There is no integer between x and y when x and y are consecutive. G may be false.
In conclusion F therefore is not valid as there are interpretations which do not satisfy F, but F is not unsatisfiable.In other words about this example, the same syntatic formula is undecidable in the theory of total order, then it is a theorem in the theory of dense orders.
A mathematical statement is written in a certain language, and we can say it is true or false in a structure that interprets all the language elements.
Patrick
Last edited: