A Note on Omitting Types inPropositional Logic

Oren Kolman

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

Analogues of the classical omitting types theoremsof first-order logic are proved for propositional logic. For aninfinite cardinalκ, a sufficient criterion is given for the omissionofκ-many types in a propositional language withκpropositionalvariables.

Author(s)

Table of Contents

A Note on Omitting Types inPropositional Logic

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

A Note on Omitting Types inPropositional Logic

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter