An epistemic and dynamic approach to abductive reasoning: Abductive problem and abductive solution

We propose a study of abductive reasoning addressing it as an epistemic process that involves both an agent?s information and the actions that modify this information. More precisely, we present and discuss definitions of an abductive problem and an abductive solution in terms of an agent?s information, that is, in terms of knowledge and beliefs. The discussion is then formalised by ‘implementing’ our definitions in a dynamic epistemic logic framework, where the properties of these definitions are studied, an epistemic action that represents the application of an abductive step is introduced, and an illustrative example is provided. A number of the most interesting properties of abductive reasoning (those highlighted by Peirce) are shown to be better modelled within this approach.     

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.     

A METAPHILOSOPHICAL DILEMMA FOR EPISTEMIC EXTERNALISM

Abstract: In this article I argue that the prevalence of intersubjective disagreement in epistemology poses a serious problem for Epistemic Externalism. I put the problem in the form of a dilemma: either Epistemic Externalism is not a complete account of epistemic justification or it's implausible to claim that the belief that Epistemic Externalism is true is itself an externalistically justified belief.     

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.     

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.     

Rough Sets and 3-Valued Logics

In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is treated as designated, the above logic is a “common denominator” for Kleene and Łukasiewicz 3-valued logics, which represent its two different “determinizations”. In turn, the weak semantics—where both t and u are treated as designated—represents such a “common denominator” for two major 3-valued paraconsistent logics. We give sound and complete, cut-free sequent calculi for both versions of the logic generated by the rough set Nmatrix. Then we derive from these calculi sequent calculi with the same properties for the various “determinizations” of those two versions of the logic (including Łukasiewicz 3-valued logic). Finally, we show how to embed the four above-mentioned determinizations in extensions of the basic rough set logics obtained by adding to those logics a special two-valued “definedness” or “crispness” operator.