On maximal intermediate logics with the disjunction property

For intermediate logics, there is obtained in the paper an algebraic equivalent of the disjunction propertyDP. It is proved that the logic of finite binary trees is not maximal among intermediate logics withDP. Introduced is a logicND, which has the only maximal extension withDP, namely, the logicML of finite problems.     

Algebraic logic for classical conjunction and disjunction

In this paper we study the relations between the fragment L of classical logic having just conjunction and disjunction and the variety D of distributive lattices, within the context of Algebraic Logic. We prove that these relations cannot be fully expressed either with the tools of Blok and Pigozzi's theory of algebraizable logics or with the use of reduced matrices for L. However, these relations can be naturally formulated when we introduce a new notion of model of a sequent calculus. When applied to a certain natural calculus for L, the resulting models are equivalent to a class of abstract logics (in the sense of Brown and Suszko) which we call distributive. Among other results, we prove that D is exactly the class of the algebraic reducts of the reduced models of L, that there is an embedding of the theories of L into the theories of the equational consequence (in the sense of Blok and Pigozzi) relative to D, and that for any algebra A of type (2,2) there is an isomorphism between the D-congruences of A and the models of L over A. In the second part of this paper (which will be published separately) we will also apply some results to give proofs with a logical flavour for several new or well-known lattice-theoretical properties.Dedicated to our master, Francesc d'A. Sales, on his 75th birthday     

The Craig interpolation theorem for prepositional logics with strong negation

This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.     

The disjunction property of intermediate propositional logics

This paper is a survey of results concerning the disjunction property, Halldén-completeness, and other related properties of intermediate prepositional logics and normal modal logics containing S4.     

A weak intuitionistic propositional logic with purely constructive implication

We introduce subsystems WLJ and SI of the intuitionistic propositional logic LJ, by weakening the intuitionistic implication. These systems are justifiable by purely constructive semantics. Then the intuitionistic implication with full strength is definable in the second order versions of these systems. We give a relationship between SI and a weak modal system WM. In Appendix the Kripke-type model theory for WM is given.This work was partially supported by NSF Grant DCR85-13417     

Distinguishing logic from association in the solution of an invisible displacement task by children (Homo sapiens) and dogs (Canis familiaris): using negation of disjunction

Prior research on the ability to solve the Piagetian invisible displacement task has focused on prerequisite representational capacity. This study examines the additional prerequisite of deduction. As in other tasks (e.g., conservation and transitivity), it is difficult to distinguish between behavior that reflects logical inference from behavior that reflects associative generalization. Using the role of negation in logic whereby negative feedback about one belief increases the certainty of another (e.g., a disjunctive syllogism), task-naive dogs (Canis familiaris; n=19) and 4- to 6-year-old children (Homo sapiens; n=24) were given a task wherein a desirable object was shown to have disappeared from a container after it had passed behind 3 separate screens. As predicted, children (as per logic of negated disjunction) tended to increase their speed of checking the 3rd screen after failing to find the object behind the first 2 screens, whereas dogs (as per associative extinction) tended to significantly decrease their speed of checking the 3rd screen after failing to find the object behind the first 2 screens.     

Definability theorems in normal extensions of the probability logic

Three variants of Beth's definability theorem are considered. Let L be any normal extension of the provability logic G. It is proved that the first variant B1 holds in L iff L possesses Craig's interpolation property. If L is consistent, then the statement B2 holds in L iff L = G + {0}. Finally, the variant B3 holds in any normal extension of G.To the memory of Jerzy Supecki     

A constructive proof of Craig's interpolation lemma for m-valued logic

The algebraic proof of Craig's interpolation lemma for m-valued logic was given by Rasiowa in [1]. We present here a constructive proof of this lemma, based on a Gentzen type formalization.     

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 decidability of a strong relevant logic

A modified filtrations argument is used to prove that the relevant logic S of [2] is decidable.     

Constructing a continuum of predicate extensions of each intermediate propositional logic

Wajsberg and Jankov provided us with methods of constructing a continuum of logics. However, their methods are not suitable for super-intuitionistic and modal predicate logics. The aim of this paper is to present simple ways of modification of their methods appropriate for such logics. We give some concrete applications as generic examples. Among others, we show that there is a continuum of logics (1) between the intuitionistic predicate logic and the logic of constant domains, (2) between a predicate extension ofS4 andS4 with the Barcan formula. Furthermore, we prove that (3) there is a continuum of predicate logics with equality whose equality-free fragment is just the intuitionistic predicate logic.Dedicated to the memory of the late Professor S. MaeharaThis research was supported in part by Grant-in Aid for Encouragement of Young Scientists No. 06740140, Ministry of Education, Science and Culture, Japan.Presented byHiroakira Ono     

Impact of negation salience and cognitive resources on negation during attitude formation

Because of the increased cognitive resources required to process negations, past research has shown that explicit attitude measures are more sensitive to negations than implicit attitude measures. The current work demonstrated that the differential impact of negations on implicit and explicit attitude measures was moderated by (a) the extent to which the negation was made salient and (b) the amount of cognitive resources available during attitude formation. When negations were less visually salient, explicit but not implicit attitude measures reflected the intended valence of the negations. When negations were more visually salient, both explicit and implicit attitude measures reflected the intended valence of the negations, but only when perceivers had ample cognitive resources during encoding. Competing models of negation processing, schema-plus-tag and fusion, were examined to determine how negation salience impacts the processing of negations.