On Fork Arrow Logic and its Expressive Power

We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order correspondence language, so both can express the same input–output behavior of processes.     

What Are We Doing When We Translate from Quantitative Models?

Although quantitative analysis (in which behavior principles are defined in terms of equations) has become common in basic behavior analysis, translational efforts often examine everyday events through the lens of narrative versions of laboratory-derived principles. This approach to translation, although useful, is incomplete because equations may convey concepts that are difficult to capture in words. To support this point, we provide a nontechnical introduction to selected aspects of quantitative analysis; consider some issues that translational investigators (and, potentially, practitioners) confront when attempting to translate from quantitative models; and discuss examples of relevant translational studies. We conclude that, where behavior-science translation is concerned, the quantitative features of quantitative models cannot be ignored without sacrificing conceptual precision, scientific and practical insights, and the capacity of the basic and applied wings of behavior analysis to communicate effectively.     

A causal model theory of the meaning of cause, enable, and prevent

The verbs cause , enable , and prevent express beliefs about the way the world works. We offer a theory of their meaning in terms of the structure of those beliefs expressed using qualitative properties of causal models, a graphical framework for representing causal structure. We propose that these verbs refer to a causal model relevant to a discourse and that "A causes B" expresses the belief that the causal model includes a link from A to B. "A enables/allows B" entails that the model includes a link from A to B, that A represents a category of events necessary for B, and that an alternative cause of B exists. "A prevents B" entails that the model includes a link from A to B and that A reduces the likelihood of B. This theory is able to account for the results of four experiments as well as a variety of existing data on human reasoning.     

A new dynamical model of brainstorming: Linear, nonlinear, continuous (simultaneous) and impulsive (sequential) cases

In this paper, we extended the linear dynamical model of [Brown, V., Paulus, P. B. (1996). A simple dynamic model of social factors in group brainstorming. Small Group Research, 27, 91-114] on two accounts. First, we modelled the sequential type brainstorming using impulsive differential equations by treating each category as an impulse and tested its validity in the two experiments that investigated and demonstrated the beneficial effects of sequential priming and memory in individual brainstorming. Finally, we considered the nonlinear case of brainstorming in writing or brainwriting where dyads exchanged their ideas in a written format and that eliminated negative factors occurring in oral brainstorming (e.g., evaluation apprehension, free-riding, production blocking) and enhanced the upward performance matching, and conducted the second experiment in order to test its validity in this paradigm with the effects of sequential priming and memory. Comparisons showed good agreement between results of experiments and those of the mathematical model.     

What is Classical Mereology?

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of fusion and correct some technical errors in prominent discussions of the axiomatization of mereology. We show the equivalence of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection between classical mereology and complete Boolean algebra by giving two “neutral” axiom sets which can be supplemented by one or the other of two simple axioms to yield the full theories; one of these uses a notion of “strong complement” that helps explicate the connections between the theories.     

Structural equations and causation: six counterexamples

Hall [(2007), Philosophical Studies, 132, 109–136] offers a critique of structural equations accounts of actual causation, and then offers a new theory of his own. In this paper, I respond to Hall’s critique, and present some counterexamples to his new theory. These counterexamples are then diagnosed.

Execution architectures for program algebra

We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation and provided with a process-algebraic, compositional semantics, and synthetic architectures, focusing on how a program may be a physical part of an execution architecture. Then we discuss in detail the Turing machine, a well-known example of an analytic architecture. The logical core of the halting problem—the inability to forecast termination behavior of programs—leads us to a few approaches and examples on related issues: forecasters and rational agents. In particular, we consider architectures suitable to run a Newcomb Paradox system and the Prisoner's Dilemma.     

An Infinitary Extension of Jankov’s Theorem

It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra B, A is embeddable into a quotient algebra of B, if and only if Jankov’s formula χ _A for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal number κ, we present Jankov’s theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible complete κ-Heyting algebras and κ-infinitary logic, where a κ-Heyting algebra is a Heyting algebra A with # ≥  κ and κ-infinitary logic is the infinitary logic such that for any set Θ of formulas with # Θ ≥  κ, ∨Θ and ∧Θ are well defined formulas.     

Congruence Coherent Symmetric Extended de Morgan Algebras

An algebra A is said to be congruence coherent if every subalgebra of A that contains a class of some congruence on A is a union of -classes. This property has been investigated in several varieties of lattice-based algebras. These include, for example, de Morgan algebras, p-algebras, double p-algebras, and double MS-algebras. Here we determine precisely when the property holds in the class of symmetric extended de Morgan algebras. Presented by M.E. Adams     

Principal Congruences on Semi-De Morgan Algebras

In this paper we use Hobby's duality for semi-De Morgan algebras, to characterize those algebras having only principal congruences in the classes of semi-De Morgan algebras, demi-pseudocomplemented lattices and almost pseudocomplemented lattices. This work extends some of the results reached by Beazer in [3] and [4].