The logic of linear tolerance

A nonempty sequence T₁,...,T_n of theories is tolerant, if there are consistent theories T ₁ ⁺ ,..., T _n ⁺ such that for each 1 i n, T _i ⁺ is an extension of T_i in the same language and, if i n, T _i ⁺ interprets T _i+1 ⁺ . We consider a propositional language with the modality , the arity of which is not fixed, and axiomatically define in this language the decidable logics TOL and TOL. It is shown that TOL (resp. TOL) yields exactly the schemata of PA-provable (resp. true) arithmetical sentences, if (A₁,..., A_n) is understood as (a formalization of) PA+A₁, ..., PA+A_n is tolerant.     

An effective fixed-point theorem in intuitionistic diagonalizable algebras

Summary Within the technical frame supplied by the algebraic variety of diagonalizable algebras, defined by R. Magari in [2], we prove the following:LetT be any first-order theory with a predicate Pr satisfying the canonical derivability conditions, including Löb's property. Then any formula inT built up from the propositional variables q, p₁, ..., p_n, using logical connectives and the predicate Pr, has the same fixed-points relative to q (that is, formulas (p₁ ..., p_n) for which for all p₁, ..., p_n T((p₁, ..., p_n), p₁, ..., p_n) (p₁, ..., p_n)) of a formula ^* of the same kind, obtained from in an effective way.Moreover, such ^* is provably equivalent to the formula obtained from substituting with ^* itself all the occurrences of q which are under Pr. In the particular case where q is always under Pr in , ^* is the unique (up to provable equivalence) fixedpoint of .Since this result is proved only assumingPr to be canonical, it can be deduced that Löb's property is, in a sense, equivalent to Gödel's diagonalization lemma.All the results are proved more generally in the intuitionistic case.The algebraization of the theories which express Theor, IXAllatum est die 19 Decembris 1975     

Rules in relevant logic — II: Formula representation

This paper surveys the various forms of Deduction Theorem for a broad range of relevant logics. The logics range from the basic system B of Routley-Meyer through to the system R of relevant implication, and the forms of Deduction Theorem are characterized by the various formula representations of rules that are either unrestricted or restricted in certain ways. The formula representations cover the iterated form,A ₁ .A ₂ . ... .A _n B, the conjunctive form,A ₁&A ₂ & ...A _n B, the combined conjunctive and iterated form, enthymematic version of these three forms, and the classical implicational form,A ₁&A ₂& ...A _n B. The concept of general enthymeme is introduced and the Deduction Theorem is shown to apply for rules essentially derived using Modus Ponens and Adjunction only, with logics containing either (A B)&(B C) .A C orA B .B C .A C.I acknowledge help from anonymous referees for guidance in preparing Part II, and especially for the suggestion that Theorem 9 could be expanded to fully contraction-less logics.     

On some ascending chains of brouwerian modal logics

This paper specifies classes of framesmaximally omnitemporally characteristic for Thomas' normal modal logicT ₂ ⁺ and for each logic in the ascending chain of Segerberg logics investigated by Segerberg and Hughes and Cresswell. It is shown that distinct a,scending chains of generalized Segerberg logics can be constructed from eachT _n ⁺ logic (n 2). The set containing allT _n ⁺ and Segerberg logics can be totally- (linearly-) ordered but not well-ordered by the inclusion relation. The order type of this ordered set is ^*( + 1). Throughout the paper my approach is fundamentally semantical.I should like to thank Professor G. E. Hughes for helpful comments on an earlier draft of this paper.     

Completeness theorem for dummett's LC quantified and some of its extensions

Dummett's logic LC quantified, Q-LC, is shown to be characterized by the extended frame Q⁺, ,D, where Q⁺ is the set of non-negative rational numbers, is the numerical relation less or equal then and D is the domain function such that for all v, w Q⁺, D_v and if v w, then D _v . D _v D _w . Moreover, simple completeness proofs of extensions of Q-LC are given.     

Simplified semantics for relevant logics (and some of their rivals)

This paper continues the work of Priest and Sylvan inSimplified Semantics for Basic Relevant Logics, a paper on the simplified semantics of relevant logics, such asB ⁺ andB. We show that the simplified semantics can also be used for a large number of extensions of the positive base logicB ⁺, and then add the dualising^* operator to model negation. This semantics is then used to give conservative extension results for Boolean negation.     

Some results on the Kripke sheaf semantics for super-intuitionistic predicate logics

Some properties of Kripke-sheaf semantics for super-intuitionistic predicate logics are shown. The concept ofp-morphisms between Kripke sheaves is introduced. It is shown that if there exists ap-morphism from a Kripke sheaf ₁ into ₂ then the logic characterized by ₁ is contained in the logic characterized by ₂. Examples of Kripke-sheaf complete and finitely axiomatizable super-intuitionistic (and intermediate) predicate logics each of which is Kripke-frame incomplete are given. A correction to the author's previous paper Kripke bundles for intermediate predicate logics and Kripke frames for intuitionistic modal logics (Studia Logica, 49(1990), pp. 289–306 ) is stated.Dedicated to Professor Takeshi Kotake on his 60th birthdayThis research was partially supported by Grant-in-Aid for Encouragement of Young Scientists No. 03740107, Ministry of Educatin, Science and Culture, Japan.     

On reduced matrices

It is shown that the class of reduced matrices of a logic is a 1 ^st order -class provided the variety associated with has the finite replacement property in the sense of [7]. This applies in particular to all 2-valued logics. For 3-valued logics the class of reduced matrices need not be 1 ^st order.     

Supererogation in Deontic Logic: Metatheory for DWE and Some Close Neighbours

In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough.     

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.     

Some Useful 16-Valued Logics: How a Computer Network Should Think

In Belnaps useful 4-valued logic, the set 2={T,F} of classical truth values is generalized to the set 4=(2)={,{T},{F},{T,F}}. In the present paper, we argue in favor of extending this process to the set 16=(4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN₃ coincide with the logic of FOUR₂, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arielis and Avrons notion of a logical bilattice and state a number of open problems for future research.Dedicated to Nuel D. Belnap on the occasion of his 75th Birthday     

On Proof Terms and Embeddings of Classical Substructural Logics

There is an intimate connection between proofs of the natural deduction systems and typed lambda calculus. It is well-known that in simply typed lambda calculus, the notion of formulae-as-types makes it possible to find fine structure of the implicational fragment of intuitionistic logic, i.e., relevant logic, BCK-logic and linear logic. In this paper, we investigate three classical substructural logics (GL, GLc, GLw) of Gentzen's sequent calculus consisting of implication and negation, which contain some of the right structural rules. In terms of Parigot's -calculus with proper restrictions, we introduce a proof term assignment to these classical substructural logics. According to these notions, we can classify the -terms into four categories. It is proved that well-typed GLx--terms correspond to GLx proofs, and that a GLx--term has a principal type if stratified where x is nil, c, w or cw. Moreover, we investigate embeddings of classical substructural logics into the corresponding intuitionistic substructural logics. It is proved that the Gödel-style translations of GLx--terms are embeddings preserving substructural logics. As by-products, it is obtained that an inhabitation problem is decidable and well-typed GLx--terms are strongly normalizable.     

Intermediate logics with the same disjunctionless fragment as intuitionistic logic

Given an intermediate prepositional logic L, denote by L ^–d its disjuctionless fragment. We introduce an infinite sequence {J _n}_n1 of propositional formulas, and prove:(1)For any L: L ^–d =I ^–d (I=intuitionistic logic) if and only if J _n L for every n 1.Since it turns out that L{J _{n} n}1 = Ø for any L having the disjunction property, we obtain as a corollary that L ^–d = I ^–d for every L with d.p. (cf. open problem 7.19 of [5]). Algebraic semantic is used in the proof of the if part of (1). In the last section of the paper we provide a characterization in Kripke's semantic for the logics J _n =I+ +J _n (n 1).     

Paraconsistent algebras

The prepositional calculiC _n , 1 n introduced by N.C.A. da Costa constitute special kinds of paraconsistent logics. A question which remained open for some time concerned whether it was possible to obtain a Lindenbaum's algebra forC _n . C. Mortensen settled the problem, proving that no equivalence relation forC _n . determines a non-trivial quotient algebra.The concept of da Costa algebra, which reflects most of the logical properties ofC _n , as well as the concept of paraconsistent closure system, are introduced in this paper.We show that every da Costa algebra is isomorphic with a paraconsistent algebra of sets, and that the closure system of all filters of a da Costa algebra is paraconsistent.     

Deduction theorems for weak implicational logics

The standard deduction theorem or introduction rule for implication, for classical logic is also valid for intuitionistic logic, but just as with predicate logic, other rules of inference have to be restricted if the theorem is to hold for weaker implicational logics.In this paper we look in detail at special cases of the Gentzen rule for and show that various subsets of these in effect constitute deduction theorems determining all the theorems of many well known as well as not well known implicational logics. In particular systems of rules are given which are equivalent to the relevance logics E,R, T, P-W and P-W-I.     

Parameter estimation in latent trait models

Latent trait models for binary responses to a set of test items are considered from the point of view of estimating latent trait parameters=( ₁, , _n ) and item parameters=( ₁, , _k ), where _j may be vector valued. With considered a random sample from a prior distribution with parameter, the estimation of (, ) is studied under the theory of the EM algorithm. An example and computational details are presented for the Rasch model.This work was supported by Contract No. N00014-81-K-0265, Modification No. P00002, from Personnel and Training Research Programs, Psychological Sciences Division, Office of Naval Research. The authors wish to thank an anonymous reviewer for several valuable suggestions.     

Omega-consistency and the diamond

G is the result of adjoining the schema (qAA)qA to K; the axioms of G* are the theorems of G and the instances of the schema qAA and the sole rule of G* is modus ponens. A sentence is -provable if it is provable in P(eano) A(rithmetic) by one application of the -rule; equivalently, if its negation is -inconsistent in PA. Let -Bew(x) be the natural formalization of the notion of -provability. For any modal sentence A and function mapping sentence letters to sentences of PA, inductively define A by: p = (p) (p a sentence letter); = ; (AB)su}= (A B); and (qA)= -Bew(A )(S) is the numeral for the Gödel number of the sentence S). Then, applying techniques of Solovay (Israel Journal of Mathematics 25, pp. 287–304), we prove that for every modal sentence A, _G A iff for all , _PA A ; and for every modal sentence A, _G* A iff for all , A is true.I should like to thank David Auerbach and Rohit Parikh.     

Predicate Logics on Display

The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem's modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap's display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules.     

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