Dialetheism and the Impossibility of the World

This paper first offers a standard modal extension of dialetheic logics that respect the normal semantics for negation and conjunction, in an attempt to adequately model absolutism, the thesis that there are true contradictions at metaphysically possible worlds. It is shown, however, that the modal extension has unsavoury consequences for both absolutism and dialetheism. While the logic commits the absolutist to dialetheism, it commits the dialetheist to the impossibility of the actual world. A new modal logic AV is then proposed which avoids these unsavoury consequences by invalidating the interdefinability rules for the modal operators with the use of two valuation relations. However, while using AV carries no significant cost for the absolutist, the same isn't true for the dialetheist. Although using AV allows her to avoid the consequence that the actual world is an impossible world, it does so only on the condition that the dialetheist admits that she cannot give a dialetheic solution to all self-referential semantic paradoxes. Thus, unless there are any further available modal logics that don't commit her to the impossibility of the actual world, the dialetheist is faced with a dilemma. Either admit that the actual world is an impossible world, or admit that her research programme cannot give a comprehensive solution to the self-referential paradoxes.     

机器学习在解决过拟合现象中的作用

过拟合现象是心理学走向预测科学的重要阻碍。文章综述了机器学习在解决过拟合现象中的价值和实现途径：（1）介绍了过拟合的两种表现形式和现状;（2）分析过拟合的根因,即“高解释力≠高预测力”;（3）厘清机器学习的建模逻辑与核心技术在解决过拟合中的作用;（4）利用样例数据和代码说明机器学习统计思想在模型拟合中的具体应用过程。文章指出心理学应从解决实际问题的角度出发,借鉴机器学习的分析思想,避免过拟合,进而提供更准确更稳定的结论和预测模型。     

New Concepts for New Dynamics: Generating Theory for the Study of Religious Innovation and Social Change

The Emerging Church movement (ECM) is sociologically interesting—not due to the size of its membership or the centrality of its congregations. Rather, the ECM is significant because it provides an opportunity to generate new concepts for the study religious innovation and social change. Using theoretical language, the ECM consists of institutional entrepreneurs who drive their religiously concerned movement by continually deconstructing and reframing beliefs, practices, and identities from “mainstream” Christianity while at the same time promoting newly formulated and broadly resonant religious imperatives. As Emerging Christians cultivate new or altered religious practices, these must be continually legitimized. Furthermore, their renegotiated beliefs (heterodoxies) require new forms of organization (alternative congregations). Such action is not the work of isolated individuals, nor is it independent of societal conditions. Ultimately, the ECM consists of Emerging Christians who creatively operate through diffuse network structures across wide geographic spaces and among disparate social groups to enact a collective institutional entrepreneurship that seeks to reimagine the assumptions of conventional Christian congregational life.     

Axiomatizing hybrid products: How can we reason many-dimensionally in hybrid logic?

The aim of this paper is to propose a two-dimensional hybrid logic in order to formalize inferences containing both spatial and temporal propositions. The semantic idea behind the proposal is to name both horizontal and vertical lines in a 2D-plane by two kinds of nominals. This is a generalization of the idea of naming a point in one-dimensional hybrid logic. I give an axiomatization of the proposed two-dimensional hybrid logic and show that it enjoys a general completeness result (called pure completeness) with respect to product Kripke frames. Moreover, in order to capture $T\times W$-frames studied by R.H. Thomason (1984), I introduce the notion of a dependent product frame, which enables us to represent the dependence of space over time. I also give a complete axiomatization of this dependent two-dimensional hybrid logic, and, as a corollary, reveal that a hybridization of $T\times W$-logic enjoys strong completeness.     

On the Closure Properties of the Class of Full G-models of a Deductive System

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACS_s A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACS_s A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. Dedicated to the memory of Willem Johannes Blok     

Gentzen Calculi for the Existence Predicate

We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.     

Selfextensional Logics with a Conjunction

A logic is selfextensional if its interderivability (or mutual consequence) relation is a congruence relation on the algebra of formulas. In the paper we characterize the selfextensional logics with a conjunction as the logics that can be defined using the semilattice order induced by the interpretation of the conjunction in the algebras of their algebraic counterpart. Using the charactrization we provide simpler proofs of several results on selfextensional logics with a conjunction obtained in [13] using Gentzen systems. We also obtain some results on Fregean logics with conjunction.This paper is a version of the invited talk at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RRAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005.     

Using temporal logics of knowledge for specification and verification—a case study

Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over time. Here we use temporal logics of knowledge to reason about the game Cluedo. We show how to specify Cluedo using temporal logics of knowledge and prove statements about the knowledge of the players using a clausal resolution calculus for this logic. We discuss the advantages and disadvantages of using this logic to specify and verify the game Cluedo and describe related implementations.     

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.