From negation to “notion”: Cognitive processes and argumentative strategies

Summary This article deals with the role of negation as a language and cognitive operation. Such a topic is treated here within the framework of the argumentative strategies which consist in making certain cognitive landmarks of the discourse flip over with the intent of imposing the necessity to choose between two types of notions, aiming at the transformation of this choice into an implication. The reference here to the Aristotelian logic of Prior Analytics appears to be more efficient than any other contemporary logic and the author intends to give account of the role of negation as contrary coming into play on an operational and cognitive basis in all the argumentative strategies which oscillate reciprocally from universal to particular.     

Every Dogma has its day

This paper is a reexamination of Two Dogmas in the light of Quine's ongoing debate with Carnap over analyticity. It shows, first, that analytic is a technical term within Carnap's epistemology. As such it is intelligible, and Carnap's position can meet Quine's objections. Second, it shows that the core of Quine's objection is that he (Quine) has an alternative epistemology to advance, one which appears to make no room for analyticity. Finally, the paper shows that Quine's alternative epistemology is itself open to very serious objections. Quine is not thereby refuted, but neither can Carnap's analyticity be dismissed as dogma.     

A New Representation Theorem for Contranegative Deontic Logic

The logic of an ought operator O is contranegative with respect to an underlying preference relation if it satisfies the property Op & (¬p)(¬q) Oq. Here the condition that is interpolative ((p (pq) q) (q (pq) p)) is shown to be necessary and sufficient for all -contranegative preference relations to satisfy the plausible deontic postulates agglomeration (Op & OqO(p&q)) and disjunctive division (O(p&q) Op Oq).     

Equivalents of Mingle and Positive Paradox

Relevant logic is a proper subset of classical logic. It does not include among its theorems any ofpositive paradox A (B A)mingle A (A A)linear order (A B) (B A)unrelated extremes (A ) (B B¯)This article shows that those four formulas have different effects when added to relevant logic, and then lists many formulas that have the same effect as positive paradox or mingle.     

Syntactical investigations intoBI logic andBB′I logic

In this note, we will study four implicational logicsB, BI, BB and BBI. In [5], Martin and Meyer proved that a formula is provable inBB if and only if is provable inBBI and is not of the form of » . Though it gave a positive solution to theP - W problem, their method was semantical and not easy to grasp. We shall give a syntactical proof of the syntactical relation betweenBB andBBI logics. It also includes a syntactical proof of Powers and Dwyer's theorem that is proved semantically in [5]. Moreover, we shall establish the same relation betweenB andBI logics asBB andBBI logics. This relation seems to say thatB logic is meaningful, and so we think thatB logic is the weakest among meaningful logics. Therefore, by Theorem 1.1, our Gentzentype system forBI logic may be regarded as the most basic among all meaningful logics. It should be mentioned here that the first syntactical proof ofP - W problem is given by Misao Nagayama [6].Presented byHiroakira Ono     

Algebraic aspects of deduction theorems

The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian.A part of this paper was presented in abstracted form in Bulletin of the Section of Logic, Vol. 12, No. 3 (1983), pp. 111–116, and in The Journal of Symbolic Logic.     

On the logic of conscious belief

In this paper we are discussing a version of propositional belief logic, denoted by LB, in which so-called axioms of introspection (B BB and B B B) are added to the usual ones. LB is proved to be sound and complete with respect to Boolean algebras equipped with proper filters (Theorem 5). Interpretations in classical theories (Theorem 4) are also considered. A few modifications of LB are further dealt with, one of which turns out to be S5.     

A reduction rule for Peirce formula

A reduction rule is introduced as a transformation of proof figures in implicational classical logic. Proof figures are represented as typed terms in a -calculus with a new constant P ⁽⁽⁾⁾. It is shown that all terms with the same type are equivalent with respect to -reduction augmented by this P-reduction rule. Hence all the proofs of the same implicational formula are equivalent. It is also shown that strong normalization fails for P-reduction. Weak normalization is shown for P-reduction with another reduction rule which simplifies of (( ) ) into an atomic type.This work was partially supported by a Grant-in-Aid for General Scientific Research No. 05680276 of the Ministry of Education, Science and Culture, Japan and by Japan Society for the Promotion of Science. Hiroakira Ono     

La Evolucion de la filosofia de Wittgenstein

Summary The author claims that there is a basic difference between theTractatus and thePhilosophical Investigations; despite Bernstein's and O'Brien's claims to the contrary, there are, indeed, two Wittgensteins. Yet, to ascertain the difference between both we must look at Wittgenstein's conceptions of philosophy rather than at his views on logic and language. Wittgenstein's different, and even divergent, views on logic and language are grounded on his two views on philosophy and not the other way around. At the same time, Wittgenstein's views on philosophy are caused by his ways of conceiving the scope of philosophical activity in regard to language. Both in theTractatus and in thePhilosophical Investigations, Wittgenstein points out what is important in language for philosophy, but in each case he reaches very different conclusions. Now, when all is said, there remains one unifying factor in all of Wittgenstein's investigations: it is the question of the logic of language, which shifts positions from theTractatus to theInvestigations, so that what was earlier a hidden structure becomes later the grammar of its indefinitely complexe uses.     

Variations in use of the term “or”

Two studies showed that adults' responses to questions involving the term or varied markedly depending upon the type of question presented. When presented with various objects (A's and B's) and asked to circle all things which are A or B subjects tended to circle A's as well as B's, whereas when asked to circle all the A's or B's subjects showed a relatively stronger tendency to circle one or the other. Moreover the nature of the sets of objects (As and Bs) influenced behavior as well. There was also evidence that the effects due to question wording or set type transferred.     

A modification of kendall's tau for measuring association in contingency tables

A coefficient of association is described for a contingency table containing data classified into two sets of ordered categories. Within each of the two sets the number of categories or the number of cases in each category need not be the same.=+1 for perfect positive association and has an expectation of 0 for chance association. In many cases also has –1 as a lower limit. The limitations of Kendall's _a and _b and Stuart's _c are discussed, as is the identity of these coefficients to' under certain conditions. Computational procedure for is given.     

On superintuitionistic logics as fragments of proof logic extensions

Coming fromI andCl, i.e. from intuitionistic and classical propositional calculi with the substitution rule postulated, and using the sign to add a new connective there have been considered here: Grzegorozyk's logicGrz, the proof logicG and the proof-intuitionistic logicI set up correspondingly by the calculiFor any calculus we denote by the set of all formulae of the calculus and by the lattice of all logics that are the extensions of the logic of the calculus, i.e. sets of formulae containing the axioms of and closed with respect to its rules of inference. In the logiclG the sign is decoded as follows: A = (A & A). The result of placing in the formulaA before each of its subformula is denoted byTrA. The maps are defined (in the definitions of x and the decoding of is meant), by virtue of which the diagram is constructedIn this diagram the maps, x and are isomorphisms, thereforex ^–1 = ; and the maps and are the semilattice epimorphisms that are not commutative with lattice operation +. Besides, the given diagram is commutative, and the next equalities take place: ^–1 = ^–1 and = ^–1 x. The latter implies in particular that any superintuitionistic logic is a superintuitionistic fragment of some proof logic extension.     

A note on the equivalence of the graded response model and the sequential model

This paper concerns items that consist of several item steps to be responded to sequentially. The item scoreX is defined as the number of correct responses until the first failure. Samejima's graded response model states that each steph=1,...,m is characterized by a parameterb _h , and, for a subject with ability, Pr(Xh; )=F(–b _h ). Tutz's general sequential model associates with each step a parameterdh, and it states that Pr(Xh;)= _r ^=1h G(–d _r ). Tutz's (1991, 1997) conjectures that the models are equivalent if and only ifF(x)=G(x) is an extreme value distribution. This paper presents a proof for this conjecture.     

On the relation provable equivalence and on partitions in effectively inseparable sets

We generalize a well-knownSmullyan's result, by showing that any two sets of the kindC _a = {x/ xa} andC _b = {x/ xb} are effectively inseparable (if I b). Then we investigate logical and recursive consequences of this fact (see Introduction).     

On the definability of the quantifier “there exist uncountably many”

In paper [5] it was shown that a great part of model theory of logic with the generalized quantifier Q x = there exist uncountably many x is reducible to the model theory of first order logic with an extra binary relation symbol. In this paper we consider when the quantifier Q x can be syntactically defined in a first order theory T. That problem was raised by Kosta Doen when he asked if the quantifier Q x can be eliminated in Peano arithmetic. We answer that question fully in this paper.I would like to thank Kosta Doen and Zoran Markovi who made valuable suggestions and remarks on a draft of this paper.     

Axiomatizing logics closely related to varieties

Let V be a s.f.b. (strongly finitely based, see below) variety of algebras. The central result is Theorem 2 saying that the logic defined by all matrices (A, d) with d A V is finitely based iff the A V have 1^st order definable cosets for their congruences. Theorem 3 states a similar axiomatization criterion for the logic determined by all matrices (A, ^A), A V, a term which is constant in V. Applications are given in a series of examples.     

The concept of a proposition in classical and quantum physics

A proposition is associated in classical mechanics with a subset of phase space, in quantum logic with a projection in Hilbert space, and in both cases with a 2-valued observable or test. A theoretical statement typically assigns a probability to such a pure test. However, since a pure test is an idealization not realizable experimentally, it is necessary — to give such a statement a practical meaning — to describe how it can be approximated by feasible tests. This gives rise to a search for a formal representation of feasible tests, which leads via mixed tests (weighted means of pure tests) to vague tests (convex sets of mixed tests). A model is described in which the latter form a continuous lattice; the pure and mixed tests are the maximal elements and the feasible tests form a basis. Each type of test has its own logic; this is illustrated by the passage from mixed tests to pure tests, which corresponds to the transition from L to classical logic.This work was supported by a grant from the National Research Council of Canada.     

Models for stronger normal intuitionistic modal logics

This paper, a sequel to Models for normal intuitionistic modal logics by M. Boi and the author, which dealt with intuitionistic analogues of the modal system K, deals similarly with intuitionistic analogues of systems stronger than K, and, in particular, analogues of S4 and S5. For these prepositional logics Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given, and soundness and completeness are proved with respect to these models. It is shown how the holding of formulae characteristic for particular logics is equivalent to conditions for the relations of the models. Modalities in these logics are also investigated.This paper presents results of an investigation of intuitionistic modal logic conducted in collaboration with Dr Milan Boi.     

Finitude and Hume’s Principle

The paper formulates and proves a strengthening of Freges Theorem, which states that axioms for second-order arithmetic are derivable in second-order logic from Humes Principle, which itself says that the number of Fs is the same as the number ofGs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. Finite Humes Principle also suffices for the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Freges definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed.     

A notorious affair called exportation

In Quantifiers and Propositional Attitudes, Quine held (a) that the rule of exportation is always admissible, and (b) that there is a significant distinction between a believes-true (Ex)Fx and (Ex) a believes-true F of x. An argument of Hintikka's, also urged by Sleigh, persuaded him that these two intuitions are incompatible; and he consequently repudiated the rule of exportation. Hintikka and Kaplan propose to restrict exportation and quantifying in to favoured contexts — Hintikka to contexts where the believer knows who or what the person or thing in question is; Kaplan to contexts where the believer possesses a vivid name of the person or thing in question. The bulk of this paper is taken up with criticisms of these proposals. Its ultimate purpose, however, is to motivate an alternative approach, which imposes no restrictions on exportation or quantifying in, but repudiates Quine's other intuition: this is the approach taken in my A Logical Form for the Propositional Attitudes.This paper is based on my doctoral dissertation (Rockefeller University, 1977). I wish to thank Susan Haack for her help in turning a draft into the present version.