Re: compactness in angels/devil problem
- From: William Elliot <marsh@xxxxxxxxxxxxxxxxxx>
- Date: Fri, 1 Feb 2008 03:11:45 -0800
On Fri, 1 Feb 2008 pauldepstein@xxxxxxx wrote:
The literature on the angels-and-devil problem often refers to aThe compactness theorem for FOL logic is:
"compactness argument" for passing from conclusions about finite
boards to conclusions about the infinite case. What is this
"compactness argument" and which topology is the compactness concept
being applied to?
if P can be concluded from an infinite set S of statements,
then P can be concluded from a finite subset of S.
Formally. Within an FOL, if S is an infinite set of statements
and S |- P, then there's a finite F subset S with F |- P.
.
- Follow-Ups:
- Re: compactness in angels/devil problem
- From: David C . Ullrich
- Re: compactness in angels/devil problem
- From: G. A. Edgar
- Re: compactness in angels/devil problem
- References:
- compactness in angels/devil problem
- From: pauldepstein
- compactness in angels/devil problem
- Prev by Date: Re: four color theorem
- Next by Date: Re: Proof that ZFC is inconsistent
- Previous by thread: compactness in angels/devil problem
- Next by thread: Re: compactness in angels/devil problem
- Index(es):
Relevant Pages
|