全文获取类型
收费全文 | 124篇 |
免费 | 1篇 |
国内免费 | 2篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 2篇 |
2016年 | 5篇 |
2014年 | 3篇 |
2013年 | 3篇 |
2012年 | 1篇 |
2011年 | 4篇 |
2009年 | 7篇 |
2008年 | 5篇 |
2007年 | 12篇 |
2006年 | 8篇 |
2005年 | 11篇 |
2004年 | 5篇 |
2003年 | 1篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有127条查询结果,搜索用时 15 毫秒
121.
Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented. 相似文献
122.
We propose a new, rather simple and short proof of Kripke-completeness for the predicate variant of Dummett's logic. Also
a family of Kripke-incomplete extensions of this logic that are complete w.r.t. Kripke frames with equality (or equivalently,
w.r.t. Kripke sheaves [8]), is described. 相似文献
123.
In this paper, we suggest a strategy for modelling cognitive context within a truth‐conditional semantics, using Asher's model of predication. This allows us to introduce the notion of type presupposition intended as a lexical constraint to the composition of the truth‐conditional content. More specifically, we suggest that this model of predication produces a notion of truth‐conditional meaning where the cognitive context fixes a set of lexical restrictions and forced modifications. We conclude that this model might offer an intermediate position between Minimalism and Contextualism: an account that provides intuitive truth conditions within a formal semantic theory. 相似文献
124.
125.
126.
Cirquent calculus is a new proof-theoretic and semantic approach introduced by G. Japaridze for the needs of his theory of computability logic (CoL). The earlier article “From formulas to cirquents in computability logic” by Japaridze generalized formulas in CoL to circuit-style structures termed cirquents. It showed that, through cirquents with what are termed clustering and ranking, one can capture, refine and generalize independence-friendly (IF) logic. Specifically, the approach allows us to account for independence from propositional connectives in the same spirit as IF logic accounts for independence from quantifiers. Japaridze's treatment of IF logic, however, was purely semantical, and no deductive system was proposed. The present paper syntactically constructs a cirquent calculus system with clustering and ranking, sound and complete w.r.t. the propositional fragment of cirquent-based semantics. Such a system captures the propositional version of what is called extended IF logic, thus being an axiomatization of a nontrivial fragment of that logic. 相似文献
127.