Some Embedding Theorems for Conditional Logic

We prove some embedding theorems for classical conditional logic, covering ‘finitely cumulative’ logics, ‘preferential’ logics and what we call ‘semi-monotonic’ logics. Technical tools called ‘partial frames’ and ‘frame morphisms’ in the context of neighborhood semantics are used in the proof.     

A general method for proving decidability of intuitionistic modal logics

We generalise the result of [H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 24–34] on decidability of the two variable monadic guarded fragment of first order logic with constraints on the guard relations expressible in monadic second order logic. In [H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 24–34], such constraints apply to one relation at a time. We modify their proof to obtain decidability for constraints involving several relations. Now we can use this result to prove decidability of multi-modal modal logics where conditions on accessibility relations involve more than one relation. Our main application is intuitionistic modal logic, where the intuitionistic and modal accessibility relations usually interact in a non-trivial way.     

Pritchard Versus Pritchard on Luck

This paper argues for a particular account of luck by comparing two distinct versions of the modal account of luck that have been provided by Duncan Pritchard (2005, 2014). More specifically, it argues that there are three respects in which Pritchard’s earlier modal account of luck is preferable to his later account: it accounts better for the fact that luck comes in degrees, it includes a significance condition, and it better acknowledges the subjective nature of luck. The paper then discusses two consequences of the points it makes for epistemology: an alleged pragmatic encroachment, and a particular view on the relation between knowledge, luck, and justification.     

心算形式对不同近似数量系统敏锐度儿童心算表现的影响

选取112名二年级小学生,以点阵比较任务测量近似数量系统敏锐度,同时以工作记忆测验成绩为协变量,探究了不同心算形式（视算、读算）对不同近似数量系统敏锐度儿童心算表现的潜在影响。结果显示：（1）心算形式显著影响心算的正确率,读算形式下儿童的心算表现最好;（2）控制工作记忆影响后,心算形式与近似数量系统敏锐分组均对心算正确率影响显著。总体来讲,读算可能是提高小学儿童简单心算表现的有效形式,并能提高低近似数量系统敏锐度儿童的心算表现。     

Decidable Cases of First-order Temporal Logic with Functions

We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be decided with EXPSPACE-complete complexity. A single rigid function is sufficient to make the logic not recursively enumerable. However, the monadic monodic fragment with rigid functions, where no two distinct terms have variables bound by the same quantifier, is decidable and EXPSPACE-complete. Presented by Robert Goldblatt     

健康行动过程取向模型的发展与前景

健康行动过程取向(HAPA)模型的提出源于健康行为社会认知模型的发展和Bandura社会认知理论的应用。在HAPA中, 健康行为变化被视为一个包括行为产生、保持和恢复在内的连续过程; 结果预期、危险感知、三种自我效能感和两类计划被用来解释意图的形成及其向行动的转化; 两个阶段的划分有助于区分三类干预对象, 建议实施菜单式干预。HAPA模型具有明显的理论优势, 也引发了有关模型实质的争论。当前和未来的研究旨在考察更多的自我调节变量、检验因果模型, 在健康行为的多个领域开展应用和干预研究。     

Sense and Reference of Predicates: Comments on Frege’s Theory of Sense-Reference

Frege argued that a predicate was a functional expression and the reference of it a concept, which as a predicative function had one or more empty places and was thus incomplete. Frege’s view gives rise to what has been known as the paradox of the concept “horse.” In order to resolve this paradox, I argue for an opposite view which retains the point that a predicate is a function, i.e. that a predicative function is complete in a sense. Specifically speaking, a predicate performing the function of a predicate has at least one empty place and has no reference, while a predicate performing the function of a subject does not have any empty place but does have a reference. Frege not only regarded a concept with one or more empty places as the reference of a predicate but also took a set of objects without any empty place to be the extension of a concept with one or more empty places. Thus, it presents a complex relationship between the reference of a predicate and its corresponding extension, leading to disharmony in his theory. I argue that this is because there is a major defect in Frege’s theory of meaning, namely the neglect of common names. What he called extensions of concepts are actually extensions of common names, and the references of predicates and the extensions of common names have a substantial difference despite being closely related.     

Sequent Calculi for Some Strict Implication Logics

We introduce various sequent systems for propositional logicshaving strict implication, and prove the completeness theoremsand the finite model properties of these systems.The cut-eliminationtheorems or the (modified) subformula properties are provedsemantically.     

Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics

A serial context-free grammar logic is a normal multimodal logicL characterized by the seriality axioms and a set of inclusionaxioms of the form _ts1..._sk. Such an inclusion axiom correspondsto the grammar rule t s₁... s_k. Thus the inclusion axioms ofL capture a context-free grammar . If for every modal index t, the set of words derivable fromt using is a regular language, then L is a serial regular grammar logic. In this paper, we present an algorithm that, given a positivemultimodal logic program P and a set of finite automata specifyinga serial regular grammar logic L, constructs a finite leastL-model of P. (A model M is less than or equal to model M' iffor every positive formula , if M then M' .) A least L-modelM of P has the property that for every positive formula , P iff M . The algorithm runs in exponential time and returnsa model with size 2^O(n³). We give examples of P and L, for bothof the case when L is fixed or P is fixed, such that every finiteleast L-model of P must have size 2⁽ⁿ⁾. We also prove that ifG is a context-free grammar and L is the serial grammar logiccorresponding to G then there exists a finite least L-modelof _s p iff the set of words derivable from s using G is a regularlanguage.     

Some Weakened Gödelian Ontological Systems

We describe a KB Gödelian ontological system, and some other weak systems, in a fully formal way using theory of types and natural deduction, and present a completeness proof in its main and specific parts. We technically and philosophically analyze and comment on the systems (mainly with respect to the relativism of values) and include a sketch of some connected aspects of Gödel's relation to Kant.