Given that ―rule-based analysis is the dominant form of reasoning‖ used by lawyers, it is probably safe to say that most lawyers would agree with Aristotle‘s sentiment. After all, this is how lawyers are taught to think in law school. Three years of their lives are slavishly devoted to the pursuit of logic with little to no emphasis on other forms of reasoning. Therefore, it is not surprising t...

1. M is set out in terms of a finite number of exact instructions (each instruction being expressed by means of a finite number of symbols); 2. M will, if carried out without error, produce the desired result in a finite number of steps; 3. M can (in practice or in principle) be carried out by a human being unaided by any machinery save paper and pencil; 4. M demands no insight or ingenuity on ...

Much effort over many years has been devoted to the reform of the teaching of physics. This has led to many new and imaginative approaches in the content and delivery of material. Great strides have been made in the delivery, and the content has been continually supplemented. However, attempts to modernize the basic structure of the presentation have faced resistance, and the majority of introd...

When combined with mirror symmetry, the A-model approach to quantization leads to a fairly simple and tractable problem. The most interesting part of the problem then becomes finding the mirror of the coisotropic brane. We illustrate how it can be addressed in a number of interesting examples related to representation theory and gauge theory, in which mirror geometry is naturally associated wit...

The paper deals with the semantics and ontology of ordinary discourse about properties. The main focus lies on the following thesis: A simple predication of the form ‘a is F’ is synonymous with the corresponding explicit property-attribution ‘a has F-ness’. An argument against this Synonymy Thesis is put forth which is based on the thesis that simple predications and property-attributions diffe...

I show that an arithmetical formula [F ] is PAprovable if, and only if, it interprets as an arithmetical expression F ∗—under a sound interpretation of PA—such that F ∗ is algorithmically decidable as true over the structure N of the natural numbers. I show how this implies, first, that P 6=NP and, second, that Church’s thesis is false.

Building off of Dean Kelley’s and Laurence Iannaccone’s earlier work, we develop a path model of the strictness thesis that investigates and compares how congregational strictness, evangelical theology, demographic characteristics, and denominational identity variously contribute to congregational growth and decline. Using the U.S. Congregational Life Survey (2001), we test this model at the co...