Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A road to ultrafilter extensions (1806.07187v1)

Published 19 Jun 2018 in math.LO and cs.LO

Abstract: We propose a uniform method of constructing ultrafilter extensions from canonical models, which is based on the similarity between ultrafilters and maximal consistent sets. This method can help us understand why the known ultrafilter extensions of models for normal modal logics and for classical modal logics are so defined. We then apply this method to obtain ultrafilter extensions of models for Kripke contingency logics and for neighborhood contingency logics.

Citations (1)

Summary

We haven't generated a summary for this paper yet.