A proof of completeness for continuous first-order logic

Details A proof of completeness for continuous first-order logic A proof of completeness for continuous first-order logic

2009-03-24

arxiv.org/abs/0903.4051v1

Mathematics

Logic

Scientific paper

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an \emph{approximated} form of strong completeness, whereby $\Sigma\vDash\varphi$ (if and) only if $\Sigma\vdash\varphi\dotminus 2^{-n}$ for all $n<\omega$. This approximated form of strong completeness asserts that if $\Sigma\vDash\varphi$, then proofs from $\Sigma$, being finite, can provide arbitrary better approximations of the truth of $\varphi$.

Affiliated with

Also associated with

No associations

Rating

A proof of completeness for continuous first-order logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A proof of completeness for continuous first-order logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof of completeness for continuous first-order logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347680