PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Low Entry average rating: No information on entry rating
compactness (Definition)

A logic is said to be $ (\kappa,\lambda)$-compact, if the following holds

If $ \Phi$ is a set of sentences of cardinality less than or equal to $ \kappa$ and all subsets of $ \Phi$ of cardinality less than $ \lambda$ are consistent, then $ \Phi$ is consistent.

For example, first order logic is $ (\omega,\omega)$-compact, for if all finite subsets of some class of sentences are consistent, so is the class itself.



"compactness" is owned by Aatu.
(view preamble)

View style:

Also defines:  compactness
Log in to rate this entry.
(view current ratings)

Cross-references: class, finite, first order logic, consistent, subsets, cardinality, sentences, logic
There are 24 references to this entry.

This is version 2 of compactness, born on 2003-08-06, modified 2003-08-06.
Object id is 4557, canonical name is Compactness.
Accessed 5822 times total.

Classification:
AMS MSC03B99 (Mathematical logic and foundations :: General logic :: Miscellaneous)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)