When family considerations influence work decisions: Decision-making processes

The work–family literature has provided an abundance of evidence that various family factors are linked to various work decisions, suggesting that the “family-relatedness” of work decisions is a prevalent phenomenon (Greenhaus & Powell, 2012). However, the cognitive processes by which such linkages occur have received little attention. We offer a framework by which to examine individuals' decision-making processes when they take family considerations into account in their work decisions. The framework suggests stages through which individuals proceed when making a work decision that takes family considerations into account and cognitive processes that influence how they proceed through each stage.     

How is God-talk logically possible? A sketch for an argument on the logic of ‘God’

In this paper I want to argue for the optimal way to characterise the logical and semantical behaviour of the singular term ‘God’ used in religious language. The relevance of this enterprise to logical theory is the main focus as well. Doing this presupposes to outline the two rivaling approaches of well-definition of singular terms: Kripke’s (“rigid designators”) and Hintikka’s (“world-lines”). ‘God’ as a “rigid designator” is purified from all real-life-language-games of identification and only spells out a metaphysical tag, which favours the view of “anything goes”. Instead, ‘God’ as a “world-line,” plus two ways of quantification, is much more flexible to theological traditions, teachings of the church, religious practices and personal feelings. Thus, it provides a sufficiently well-defined singular term for the purposes of logical theory. The whole sketch is based on Jaakko Hintikka’s logical ideas, mainly on his responses to different authors in PJH. I have systematically omitted direct references to his texts because I have modified considerably his ideas for my own purposes.     

现象学与逻辑学

无论在胡塞尔思想中还是在海德格尔思想中,现象学与逻辑学的关系都构成一个核心问题。本文首先再现了胡塞尔前后期在此问题上的相关研究,并指出他的超越论逻辑学的要点在于对本质的前逻辑直观,也是最有可能为逻辑学提供哲学支撑的因素。其次,在海德格尔方面,根据律概念成为讨论现象学与逻辑学关系的切入点,由此导出他的“存在理解”、“无蔽”和“自由”的概念解释。他们的共同点在于：把形式逻辑看作陈述逻辑,并试图用前谓词判断的哲学逻辑学来为它奠基。     

First Order Common Knowledge Logics

In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol only. Then formal properties of "quantifying into" epistemic contexts are investigated. The results are illustrated by means of epistemic representations of Nash Equilibria for finite games with mixed strategies.     

Husserl’s philosophy of mathematics: its origin and relevance

This paper offers an exposition of Husserl's mature philosophy of mathematics, expounded for the first time in Logische Untersuchungen and maintained without any essential change throughout the rest of his life. It is shown that Husserl's views on mathematics were strongly influenced by Riemann, and had clear affinities with the much later Bourbaki school.

Proof-Theoretic Modal PA-Completeness I: A System-Sequent Metric

This paper is the first of a series of three articles that present the syntactic proof of the PA-completeness of the modal system G, by introducing suitable proof-theoretic objects, which also have an independent interest. We start from the syntactic PA-completeness of modal system GL-LIN, previously obtained in [7], [8], and so we assume to be working on modal sequents S which are GL-LIN-theorems. If S is not a G-theorem we define here a notion of syntactic metric d(S, G): we calculate a canonical characteristic fomula H of S (char(S)) so that _G H (S) and _GL-LIN H, and the complexity of H gives the distance d(S, G) of S from G. Then, in order to produce the whole completeness proof as an induction on this d(S, G), we introduce the tree-interpretation of a modal sequent Q into PA, that sends the letters of Q into PA-formulas describing the properties of a GL-LIN-proof P of Q: It is also a d(*, G)-metric linked interpretation, since it will be applied to a proof-tree T of H with H = char(S) and ( H) = d(S, G).     

Applying a Theory of Change Approach to Interagency Planning in Child Mental Health

This paper describes the use of a theory of change approach to community-based cross-agency service planning for children with serious emotional disturbance and their families. Public agency planners in Contra Costa County, California used the theory of change approach to organize service planning for a population of youth who had been arrested and involved with juvenile probation. The theory of change process described in this paper links community outcomes with planned activities with the assumptions or principles that underlie the community planning efforts. When complete, a theory of change logic model can serve as a guide for implementation, ensuring that community plans for service delivery remain true to their intent. The theory of change development process includes twelve stages and is based on a step-by-step approach. Theory of change logic models establish a context for articulating a community's shared beliefs and prompt local stakeholders to establish logical connections between the population to be served, expected results, and strategies intended to achieve those results.     

Substructural Logics in Natural Deduction

Extensions of Natural Deduction to Substructural Logics of IntuitionisticLogic are shown: Fragments of Intuitionistic Linear, Relevantand BCK Logic. Rules for implication, conjunction, disjunctionand falsum are defined, where conjunction and disjunction respectcontexts of assumptions. So, conjunction and disjunction areadditive in the terminology of linear logic. Explicit contractionand weakening rules are given. It is shown that conversionsand permutations can be adapted to all these rules, and thatweak normalisation and subformula property holds. The resultsgeneralise to quantification.