# criterion for consistency of sets of formulas

Let $L$ be a first order language, and $\mathrm{\Delta}\subseteq L$ be a set of sentences^{}. Then $\mathrm{\Delta}$ is consistent if and only if every finite subset of $\mathrm{\Delta}$ is consistent.

Title | criterion for consistency of sets of formulas |
---|---|

Canonical name | CriterionForConsistencyOfSetsOfFormulas |

Date of creation | 2013-03-22 12:44:05 |

Last modified on | 2013-03-22 12:44:05 |

Owner | jihemme (316) |

Last modified by | jihemme (316) |

Numerical id | 5 |

Author | jihemme (316) |

Entry type | Corollary |

Classification | msc 03B10 |

Classification | msc 03C07 |