Compactness of a supervaluational language

DOI10.2307/2273555zbMATH Open0521.03017OpenAlexW2148993922MaRDI QIDQ3671133FDOQ3671133

Authors: Ermanno Bencivenga 

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273555

zbMATH Keywords

compactnessstabilizationsupervaluational quantifier-free language

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Cites Work

• A Topological Proof of the Löwenheim‐Skolem, Compactness, and Strong Completeness Theorems for Free Logic

This page was built for publication: Compactness of a supervaluational language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671133)