Some notes on the superintuitionistic logic of chequered subsets of ℝ^∞

arXiv: Logic in Computer Science(2018)

引用 23|浏览5
暂无评分
摘要
I investigate the superintuitionistic analogue of the modal logic of chequered subsets of ℝ^∞ introduced by van Benthem et al. It is observed that this logic possesses the disjunction property, contains the Scott axiom, fails to contain the Kreisel-Putnam axiom and it is a sublogic of the Medvedev logic.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要