In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...

Hilbert-style axiomatic systems are presented for versions of the modal logics KΣ, where Σ ⊆ {D,4,5}, with non-contingency as the sole modal primitive. The classes of frames characterized by the axioms of these systems are shown to be first-order definable, though not equal to the classes of serial, transitive, or euclidean frames. The canonical frame of the non-contingency logic of any logic c...

Over the last 12 years, through my work at the Centre for Mindfulness Research and Practice (CMRP) at Bangor University, I have been engaged with colleagues (both within CMRP and from other training centres in the UK) in an exploration of how to support the development of a robust professional practice context for our own teaching team and for the growing community of mindfulness-based teachers...

The argument from contingency for the existence of God is best understood as a request for an explanation of the total sequence of causes and effects in the universe (‘History’ for short). Many puzzles about how there could be such an explanation arise from the assumption that God is being introduced as one more cause prepended to the sequence of causes that (allegedly) needed explaining. In re...

The traditional control procedures for Pavlovian conditioning are examined and each is found wanting. Some procedures introduce nonassociative factors not present in the experimental procedure while others transform the excitatory, experimental CS-US contingency into an inhibitory contingency. An alternative control procedure is suggested in which there is no contingency whatsoever between CS a...