Harold Hodes

Albert Menne and Niels Öffenberger, Zur modernen Deutung der aristotelischen Logik. Band I:Über den Folgerungsbegriff in der aristotelischen Logik. Hildesheim and New York: Georg Olms Verlag, 1982. 220 pp. DM 48.Klaus Jacobi, Die Modalbegriffe in den logischen Schriften des Wilhelm von Shyreswood und in anderen Kompendien des 12. und 13. Jahrhunderts. Funktionsbestimmung und Gebrauch in der logischen Analyse. Leiden and KÖln: E.J. Brill, 1980. xiii + 528 pp. HFL 140.Nineteenth – Century ContrastsAnthony Manser, Bradley's Logic. Oxford; Basil Blackwell, 1983. x + 220 pp. £17.50.Gregory Currie, Frege. An introduction to his philosophy. Brighton: Harvester Press; Totowa, New Jersey: Barnes & Noble Books; 1982. xi + 212 pp. £18.95.Eike-Henner W. Kluge, The metaphysics of Gottlob Frege. An essay in ontological reconstruction. The Hague. Boston, and London: Martinus Nijhoff Publishers, 1980. 296 pp, Dfl. 80/$35.00.Philosophy and LogicGeorg Henrik Von Wright, Practical reason. Oxford: Basil Blackwell, 1983. x + 214 pp. £15.00.Patrick Shaw, Logic and its limits. London and Sydney: Pan Books, in association with Heinemann Educational Books, 1981. 255 pp. £2.95.William S. Hatcher, The logical foundations of mathematics. Oxford, Toronto, Sydney, Paris and Frankfurt: 1982. x + 320 pp. £19.00/$38.00.E.N. Zalta,objects. An introduction to axiomatic metaphysics Dordrecht, Boston and Lancaster: Keldei, 1983, xiil + 193 pp. $39.50.MiscellaneousR. Schacht, Nietzsche. London, Boston, Melbourne and Henley: Routledge & Kegan Paul, 1983. xxii + 546 pp. £18.50.V. Biryukov and A.G. Spirkina, Voprosy kibernetiki. Kibernetika i logicheskaya formalizatsiya. Aspekty istorii i metodologii. Moscow: Akademiya Nauk SSSR, ‘Kibernetika’1982. 191 pp. 2 rubles.

Two slogans define structuralism: contemporary mathematics studies structures; mathematical objects are places in those structures. Shapiro’s version of structuralism posits abstract objects of three sorts. A system is “a collection of objects with certain relations” between these objects. “An extended family is a system of people with blood and marital relationships.” A baseball defense, e.g., the Yankee’s defense in the first game of the 1999 World Series, is a also a system, “a collection of people with on-field spatial and ‘defensive-role’ relations”. “A structure is the abstract form of a system” ; it consists of “a collection of places [sometimes called positions or offices] and a finite collection of functions and relations on these places”.

I prove that the Boolean Prime Ideal Theorem is equivalent, under some weak set-theoretic assumptions, to what I will call the Cut-for-Formulas to Cut-for-Sets Theorem: for a set F and a binary relation |- on Power(F), if |- is finitary, monotonic, and satisfies cut for formulas, then it also satisfies cut for sets. I deduce the CF/CS Theorem from the Ultrafilter Theorem twice; each proof uses a different order-theoretic variant of the Tukey- Teichmüller Lemma. I then discuss relationships between various cut-conditions in the absence of finitariness or of monotonicity.

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 presents the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.)

Part 1 [Hodes, 2021] “looked under the hood” of the familiar versions of the classical propositional modal logic K and its intuitionistic counterpart. This paper continues that project, addressing some familiar classical strengthenings of K and GL), and their intuitionistic counterparts. Section 9 associates two intuitionistic one-step proof-theoretic systems to each of the just mentioned intuitionistic logics, this by adding for each a new rule to those which generated IK in Part 1. For the systems associated with the intuitionistic counterparts of D and T, these rules are “pure one-step”: their schematic formulations does not use □ or ♢. For the systems associated with the intuitionistic counterparts of K4, etc., these rules meet these conditions: neither □ nor ♢ is iterated; none use both □ and ♢. The join of the two systems associated with each of these familiar logics is the full one-step system for that intuitionistic logic. And further “blended” intuitionistic systems arise from joining these systems in various ways. Adding the 0-version of Excluded Middle to their intuitionistic counterparts yields the one-step systems corresponding to the familiar classical logics. Each proof-theoretic system defines a consequence relation in the obvious way. Section 10 examines inclusions between these consequence relations. Section 11 associates each of the above consequence relations with an appropriate class of models, and proves them sound with respect to their appropriate class. This allows proofs of some failures of inclusion between consequence relations. Section 12 proves that the each consequence relation is complete or weakly complete, that relative to its appropriate class of models. The Appendix presents three further results about some of the intuitionistic consequence relations discussed in the body of the paper. For Keywords, see Part 1.

This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too implausible to make these arguments troubling. The second reason is conditional on a substitutional interpretation of quantification over types other than that of individuals. This reason stands up to investigation: a simple-type language will not sustain such an interpretation, but a ramified-type language will. And there is evidence that Russell was tacitly inclined towards such an interpretation. A strong construal of that interpretation opens a way to make sense of Russell’s simultaneous repudiation of propositions and his willingness to quantify over them. But that way runs into trouble with Russell’s commitment to the finitude of human understanding.

Relative to any reasonable frame, satisfiability of modal quantificational formulae in which “= ” is the sole predicate is undecidable; but if we restrict attention to satisfiability in structures with the expanding domain property, satisfiability relative to the familiar frames (K, K4, T, S4, B, S5) is decidable. Furthermore, relative to any reasonable frame, satisfiability for modal quantificational formulae with a single monadic predicate is undecidable ; this improves the result of Kripke concerning formulae with two monadic predicates.

Where AR is the set of arithmetic Turing degrees, 0 (ω ) is the least member of { $\mathbf{\alpha}^{(2)}|\mathbf{a}$ is an upper bound on AR}. This situation is quite different if we examine HYP, the set of hyperarithmetic degrees. We shall prove (Corollary 1) that there is an a, an upper bound on HYP, whose hyperjump is the degree of Kleene's O. This paper generalizes this example, using an iteration of the jump operation into the transfinite which is based on results of Jensen and is detailed in [3] and [4]. In $\S1$ we review the basic definitions from [3] which are needed to state the general results