Abstract
We study three kinds of compactness in some variants of Gödel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the compactness property of extensions of first-order Gödel logic enriched by nullary connective or the Baaz's projection connective. In the case of uncountable first-order language we use the ultraproduct method to derive the compactness theorem
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.