...
首页> 外文期刊>journal of semantics >A Simplified Theory of Boolean Semantic Types
【24h】

A Simplified Theory of Boolean Semantic Types

机译:A Simplified Theory of Boolean Semantic Types

获取原文
           

摘要

The theory of semantic types in Keenan and Faltz (I985) is insufficiently constrained in the sense that it requires denumerable categories to be interpreted under certain conditions via nondenumerable algebras. An ontologically more austere version of the theory is proposed in which expressions are always interpreted in terms of finite algebras and it is shown how it is nonetheless possible to treat an infinite language by providing an inductively defined hierarchy of such algebras, each representing a stage of an expanding knowledge base. Some apparent obstacles are considered and disposed of and some advantages discussed, having to do with the alethic modalities and referential opacity induced by predicates of propositional attitude. Finally, it is shown that a weaker version of Keenan and Faltz's central mathematical result, the Justification Theorem, suffices for the revised system and a simple, intuitive proof for it is given.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号