全文获取类型
收费全文 | 132篇 |
免费 | 3篇 |
出版年
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 2篇 |
2016年 | 2篇 |
2013年 | 11篇 |
2011年 | 7篇 |
2010年 | 4篇 |
2009年 | 7篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 1篇 |
1967年 | 2篇 |
1962年 | 2篇 |
1961年 | 2篇 |
1960年 | 1篇 |
1958年 | 1篇 |
1956年 | 2篇 |
1955年 | 1篇 |
1949年 | 1篇 |
排序方式: 共有135条查询结果,搜索用时 15 毫秒
41.
42.
43.
44.
Andrzej W. Jankowski 《Studia Logica》1984,43(4):341-351
This paper is closely related to investigations of abstract properties of basic logical notions expressible in terms of closure spaces as they were begun by A. Tarski (see [6]). We shall prove many properties of ω-conjunctive closure spaces (X is ω-conjunctive provided that for every two elements of X their conjunction in X exists). For example we prove the following theorems:
- For every closed and proper subset of an ω-conjunctive closure space its interior is empty (i.e. it is a boundary set).
- If X is an ω-conjunctive closure space which satisfies the ω-compactness theorem and \(\hat P\) [X] is a meet-distributive semilattice (see [3]), then the lattice of all closed subsets in X is a Heyting lattice.
- A closure space is linear iff it is an ω-conjunctive and topological space.
- Every continuous function preserves all conjunctions.
45.
Andrzej Wiśniewski 《Studia Logica》1991,50(2):261-274
The concept of erotetic argument is introduced. Two relations between sets of declarative sentences and questions are analysed; and two classes of erotetic arguments are characterized. 相似文献
46.
47.
In the present paper the well-known Gödels – Churchs argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interestingfi The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions are put into the proof. Instead of the arithmetization I use the theory of concatenation (formalized by Alfred Tarski). This theory proves to be an appropriate tool. The decidability is defined directly as the property of graphical discernibility of formulas. 相似文献
48.
Andrzej Wiśniewski 《Synthese》1996,109(1):1-25
This paper argues for the idea that the logic of questions should focus its attention on the analysis of arguments in which questions play the role of conclusions. The relevant concepts of validity are discussed and the concept of the logic of questions of a semantically interpreted formalized language is introduced.This paper was presented at the symposium Erotetic Logic. A Dialogue organized by the Center for the Philosophy and History of Science of Boston University (February, 1994) and prepared during my stay at the Department of Philosophy, University of California, Riverside as a Fulbright grantee.I would like to thank Professors David Harrah and Sylvain Bromberger for valuable suggestions and comments. 相似文献
49.
Andrzej Sendlewski 《Studia Logica》1995,55(3):377-388
We study axiomatic extensions of the propositional constructive logic with strong negation having the disjunction property in terms of corresponding to them varieties of Nelson algebras. Any such varietyV is characterized by the property: (PQWC) ifA,B εV, thenA×B is a homomorphic image of some well-connected algebra ofV. We prove:
- each varietyV of Nelson algebras with PQWC lies in the fibre σ?1(W) for some varietyW of Heyting algebras having PQWC,
- for any varietyW of Heyting algebras with PQWC the least and the greatest varieties in σ?1(W) have PQWC,
- there exist varietiesW of Heyting algebras having PQWC such that σ?1(W) contains infinitely many varieties (of Nelson algebras) with PQWC.
50.