全文获取类型
收费全文 | 77篇 |
免费 | 1篇 |
出版年
2023年 | 2篇 |
2020年 | 2篇 |
2018年 | 1篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2013年 | 4篇 |
2012年 | 1篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 1篇 |
2006年 | 2篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2000年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有78条查询结果,搜索用时 15 毫秒
1.
Janusz Czelakowski 《Studia Logica》1985,44(4):369-387
The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian.A part of this paper was presented in abstracted form in Bulletin of the Section of Logic, Vol. 12, No. 3 (1983), pp. 111–116, and in The Journal of Symbolic Logic. 相似文献
2.
3.
Janusz Czelakowski Roger Maddux Gerhard Schurz Kazimierz Trzesicki 《Studia Logica》1986,45(2):223-229
4.
Guido Peeters Marie-France Cammaert Janusz Czapinski 《International journal of psychology》1997,32(1):23-34
Using a variant of Weinstein's (1980) technique for the measurement of unrealistic optimism, subjects were classified as optimistic, realistic, or pessimistic about their chances of being confronted in the future with problems such as divorce, nervous breakdown, etc. On the basis of previous theory and research on cognition and affect, it was hypothesized that, across problems, subjects would alternate optimism with realism rather than with pessimism. Cross-cultural data obtained from 19 samples of Belgian, Moroccan, and Polish subjects not only confirmed the hypothesis but also showed high agreement about the nature of the problems that were selectively associated with optimism, realism and pessimism. 相似文献
5.
Janusz Czelakowski 《Studia Logica》1983,42(4):417-429
The classesMatr( \( \subseteq \) ) of all matrices (models) for structural finitistic entailments \( \subseteq \) are investigated. The purpose of the paper is to prove three theorems: Theorem I.7, being the counterpart of the main theorem from Czelakowski [3], and Theorems II.2 and III.2 being the entailment counterparts of Bloom's results [1]. Theorem I.7 states that if a classK of matrices is adequate for \( \subseteq \) , thenMatr( \( \subseteq \) ) is the least class of matrices containingK and closed under the formation of ultraproducts, submatrices, strict homomorphisms and strict homomorphic pre-images. Theorem II.2 in Section II gives sufficient and necessary conditions for a structural entailment to be finitistic. Section III contains theorems which characterize finitely based entailments. 相似文献
6.
7.
A deductive system $\mathcal{S}$ (in the sense of Tarski) is Fregean if the relation of interderivability, relative to any given theory T, i.e., the binary relation between formulas $$\{ \left\langle {\alpha ,\beta } \right\rangle :T,\alpha \vdash s \beta and T,\beta \vdash s \alpha \} ,$$ is a congruence relation on the formula algebra. The multiterm deduction-detachment theorem is a natural generalization of the deduction theorem of the classical and intuitionistic propositional calculi (IPC) in which a finite system of possibly compound formulas collectively plays the role of the implication connective of IPC. We investigate the deductive structure of Fregean deductive systems with the multiterm deduction-detachment theorem within the framework of abstract algebraic logic. It is shown that each deductive system of this kind has a deductive structure very close to that of the implicational fragment of IPC. Moreover, it is algebraizable and the algebraic structure of its equivalent quasivariety is very close to that of the variety of Hilbert algebras. The equivalent quasivariety is however not in general a variety. This gives an example of a relatively point-regular, congruence-orderable, and congruence-distributive quasivariety that fails to be a variety, and provides what apparently is the first evidence of a significant difference between the multiterm deduction-detachment theorem and the more familiar form of the theorem where there is a single implication connective. 相似文献
8.
Jennifer A. Janusz Michael W. Kirkwood Keith Owen Yeates H. Gerry Taylor 《Child neuropsychology》2013,19(3):179-194
The effects of childhood traumatic brain injury (TBI) on social problem-solving were examined in 35 children with severe TBI, 40 children with moderate TBI, and 46 children with orthopedic injuries (OI). The children were recruited prospectively following injuries that occurred between 6 and 12 years of age. They were followed longitudinally, and ranged from 9 to 18 years of age at the time of the current study, which occurred on average 4 years post injury. They were administered a semi-structured interview used in previous research on social problem-solving to assess the developmental level of their responses to hypothetical dilemmas involving social conflict. Children in the severe TBI group defined the social dilemmas and generated alternative strategies to solve those dilemmas at the same developmental level as did children in the OI group. However, they articulated lower-level strategies as the best way to solve the dilemmas and used lower-level reasoning to evaluate the effectiveness of the strategies. After controlling for group membership, race, socioeconomic status, IQ, and age, children's social problem-solving, and particularly the developmental level of their preferred strategies for resolving conflicts, predicted parents ratings of children's social skills, peer relationships, aggressive behavior, and academic performance. The findings indicate that children with severe TBI demonstrate selective, long-term deficits in their social problem-solving skills that may help to account for their poor social and academic outcomes. 相似文献
9.
Studia Logica - This paper, being a companion to the book [2] elaborates the deontology of sequential and compound actions based on relational models and formal constructs borrowed from formal... 相似文献
10.