A Note on Omitting Types inPropositional Logic

Oren Kolman

Received N/A; revised N/A; accepted N/A

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

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)

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

ON q-LATTICES AND q-ALGEBRAS

ON INCREASING HAZARD RATE OF WAITING TIME IN THE ||1|∞MG MODEL

ON DISTRIBUTION’S CONSTANT SLOWLY VARYING COMPONENT

A Note on Omitting Types inPropositional Logic

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter