目标设置过程的理性特征分析

本文运用个案研究方法 ,从人类理性的角度分析了企业在不同的生产经营条件下的目标设置方式 ,发现不确定性和目标难度对管理者的目标设置过程有很大的影响。在确定的 ,且任务较容易的情况下 ,目标设置是以一种与理性期望模型相一致的方式进行的 ,而在高度不确定的条件下 ,管理者则倾向于采用渐进适应的模式设置目标。对管理者的经营活动作进一步深入的分析发现 ,在高难度的任务目标情景中 ,决策者更多地从战略的层次 ,而不是从具体的层次上寻求实现目标的途径 ,从而提出了目标难度与实绩的“策略搜索层次”假设     

Finite structural axiomatization of every finite-valued propositional calculus

In [2] A. Wroski proved that there is a strongly finite consequence C which is not finitely based i.e. for every consequence C ⁺ determined by a finite set of standard rules C C ⁺. In this paper it will be proved that for every strongly finite consequence C there is a consequence C ⁺ determined by a finite set of structural rules such that C(Ø)=C ⁺(Ø) and = (where , are consequences obtained by adding to the rules of C, C ⁺ respectively the rule of substitution). Moreover it will be shown that under certain assumptions C=C ⁺.     

Strong completeness with respect to finite kripke models

We prove that each intermediate or normal modal logic is strongly complete with respect to a class of finite Kripke frames iff it is tabular, i.e. the respective variety of pseudo-Boolean or modal algebras, corresponding to it, is generated by a finite algebra. The author wishes to thank the Editors for calling his attention to the fact that the result of this paper concerning the intermediate logics was announced earlier by A. Wroński at the conference “Logical calculi”, Wrocław, October 5–7, 1975, though without proof. Wroński's result has not been published.     

On finite approximability of ψ-intermediate logics

The aim of this note is to show (Theorem 1.6) that in each of the cases: = {, }, or {, , }, or {, , } there are uncountably many -intermediate logics which are not finitely approximable. This result together with the results known in literature allow us to conclude (Theorem 2.2) that for each : either all -intermediate logics are finitely approximate or there are uncountably many of them which lack the property.