One Upper Estimate on the Number of Limit Cycles of Even Degree Li\'enard Equations in the Focus Case

We give an explicit upper bound for a number of limit cycles of the Li\'enard equation $\dot{x}=y-F(x)$, $\dot{y}=-x$ of even degree in the case its unique singular point $(0,0)$ is a focus.Comment: 10 pages, 1 figur

Possible worlds semantics and the liar: Reflections on a problem posed by Kaplan

In this paper I discuss a paradox, due to David Kaplan, that in his view threatens the use of possible worlds semantics as a model-theoretic framework for intensional logic. 1 Kaplan’s paradox starts out from an intuitively reasonable principle that I refer to as the Principle of Plenitude

Do you want to bet? The prevalence of problem gambling amongst athletes in the UK

This presentation was given as part of the 2011 London Workshop on Problem Gambling: Theory and (Best) Practice by Dr Daniel Rhind from the Sports Sciences subject area at Brunel University. The workshop was organised by Professor Fernand Gobet and Dr Marvin Schiller and hosted by Brunel University on the 13th September 2011

South Carolina Clergy Consultation Service For Problem Pregnancy Records - Accession 66

The South Carolina Clergy Consultation Service For Problem Pregnancy Records consist of correspondence, financial records, case study questionnaires and reference materials, documenting the efforts of the Pro-Choice organization (SCCCS) to provide counseling service for women seeking abortions. The SCCCS opened its services in 1970. Correspondents include Rev. Howard Moody, National Clergy Consultation Service Coordinator; South Carolina Senators Ernest F. Hollings, and Strom Thurmond; and South Carolina Congressman James K. Mann.https://digitalcommons.winthrop.edu/manuscriptcollection_findingaids/1117/thumbnail.jp

PushPush is NP-Hard in 3D

We prove that a particular pushing-blocks puzzle is intractable in 3D. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the maximal extent of its free range. We prove this version is NP-hard in 3D by reduction from SAT. The corresponding problem in 2D remains open