全文获取类型
收费全文 | 330篇 |
免费 | 5篇 |
专业分类
335篇 |
出版年
2022年 | 10篇 |
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 13篇 |
2018年 | 10篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 8篇 |
2013年 | 26篇 |
2012年 | 5篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 3篇 |
2007年 | 6篇 |
2005年 | 6篇 |
2004年 | 6篇 |
2003年 | 7篇 |
1998年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1987年 | 2篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 6篇 |
1972年 | 3篇 |
1970年 | 7篇 |
1969年 | 3篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1966年 | 6篇 |
1965年 | 9篇 |
1964年 | 3篇 |
1963年 | 6篇 |
1962年 | 4篇 |
1961年 | 10篇 |
1960年 | 6篇 |
1958年 | 7篇 |
1957年 | 4篇 |
1956年 | 4篇 |
1955年 | 6篇 |
排序方式: 共有335条查询结果,搜索用时 0 毫秒
111.
112.
Dorota Leszczyńska-Jasion 《Journal of Philosophical Logic》2009,38(2):151-177
The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic
proofs for modal logics, which is grounded in the logic of questions IEL. 相似文献
113.
Maria Bulińska 《Studia Logica》2009,93(1):1-14
Nonassociative Lambek Calculus (NL) is a syntactic calculus of types introduced by Lambek [8]. The polynomial time decidability
of NL was established by de Groote and Lamarche [4]. Buszkowski [3] showed that systems of NL with finitely many assumptions
are decidable in polynomial time and generate context-free languages; actually the P-TIME complexity is established for the
consequence relation of NL. Adapting the method of Buszkowski [3] we prove an analogous result for Nonassociative Lambek Calculus
with unit (NL1). Moreover, we show that any Lambek grammar based on NL1 (with assumptions) can be transformed into an equivalent
context-free grammar in polynomial time. 相似文献
114.
Jacek K. Kabziński 《Studia Logica》1982,41(1):17-40
In this paper we investigate some basic semantic and syntactic conditions characterizing the equivalence connective. In particular we define three basic classes of algebras: the class of weak equivalential algebras, the class of equivalential algebras and the class of regular equivalential algebras (see [12]).Weak equivalential algebras can be used to study purely equivalential fragments of relevant logics and strict equivalential fragments of some modal logics (for investigations of strict implicational fragments of modal logics see [20]). Equivalential algebras are suitable to study purely equivalential fragment of BCI and BCK logic (see [21], p. 316). A subclass of the class of regular equivalential algebras is suitable to study equivalential fragments of ukasiewicz logics. Some subvarieties of the class of regular equivalential algebras provide natural semantics for equivalential fragments of the intuitionistic prepositional logic and various intermediate logics (see [13]).The last chapter is a selection of research problems which in the author's opinion are worth to be solved. 相似文献
115.
J. M. Bocheński 《Studies in East European Thought》1973,13(1-2):1-10
With the passing of S. A. Janovskaja, contemporary Soviet philosophy has lost one of its leading experts in logic and in combining creativity with survival. 相似文献
116.
A Bilikiewicz K Matkowski K Przybysz M Dabkowski B Ksiazkiewicz J Raczkiewicz-Cywińska M Jakubowska 《Psychiatrie, Neurologie, und medizinische Psychologie》1988,40(1):9-15
In the years 1976-1980, the province of Bydgoszcz had a total of 2635 registered epileptics, or 0.37% of the entire population, over the age of 16. From these, 200 patients were randomly selected, and between 1983 and 1985 a complats clinical follow-up investigation was carried out. Among the most frequent mental disorders found were postparoxysmal twilight state (19.5%) and affective psychoses (11%), among the chronic disorders, dementia of varying intensity (26.5%). In contrast with previous investigations the present investigation made it possible to determine with precision the cause of epileptic attacks. The ratio was 61% to 31%. 相似文献
117.
118.
119.
Bartłomiej Taurogiński Antonina Bryniarska Barbara Józefik 《Journal of Family Therapy》2023,45(3):331-347
The constructionist view assumes that therapy participants' maps of understanding depend on the institutional context and their personal perspectives. The purpose of this study was to investigate the initial maps of difficulties reported by family members starting family therapy. 106 families that were referred to a psychiatric institution for outpatient family therapy were asked open-ended questions regarding the context of the referral, and goal and problem formulation for the therapy. The data were analysed via the consensual qualitative research-modified (CQR-M) method, and comparisons between groups were performed. The obtained results show a diversity of perspectives. Of interest was the predominance of medical language in describing the problem and relational language in describing the goal of therapy. An analysis of differences between mothers, fathers, adolescent patient and their siblings was also performed. The findings highlight the complexity of notions that families start family therapy with and may help therapists navigate through the therapeutic contract formulation process. 相似文献
120.