Masked stimuli can affect the preparation of a motor response to subsequently presented target stimuli. Under some conditions, reactions to the main stimulus can be facilitated or inhibited when preceded by a compatible prime . In the majority of studies in which inverse priming was demonstrated arrows pointing left or right were used as prime and targets. There is, however, evidence that arrows are special overlearned stimuli which are processed in a favorable way. Here we report three experiments designated to (...) test whether the “arrowness” of primes/targets is a sufficient condition for inverse priming. The results clearly show that although inverse priming appeared when non-arrow shapes were used, the magnitude of the priming effect was larger with arrows. The possible reasons for this effect are discussed. (shrink)

A survey is given of three-valued paraconsistent propositionallogics connected with Jaśkowski’s criterion for constructing paraconsistentlogics. Several problems are raised and four new matrix three-valued paraconsistent logics are suggested.

We outline the rather complicated history of attempts at axiomatizing Jaśkowski’s discussive logic $$\mathbf {D_2}$$ D2 and show that some clarity can be had by paying close attention to the language we work with. We then examine the problem of axiomatizing $$\mathbf {D_2}$$ D2 in languages involving discussive conjunctions. Specifically, we show that recent attempts by Ciuciura are mistaken. Finally, we present an axiomatization of $$\mathbf {D_2}$$ D2 in the language Jaśkowski suggested in his second paper on discussive (...) logic, by following a remark of da Costa and Dubikajtis. We also deal with an interesting variant of $$\mathbf {D_2}$$ D2, introduced by Ciuciura, in which negation is also taken to be discussive. (shrink)

A universally free logic is a system of quantification theory, with or without identity, whose theses remain logically true if the domain of quantification is empty and some of the singular terms present in the language do not denote existing objects. In the West, logics satisfying and ones satisfying were developed starting in the 1950s. But Stanisław Jaśkowski preceded all this work by some twenty years: his paper “On the Rules of Supposition in Formal Logic” of 1934 can be (...) regarded as containing, at least implicitly, the first universally free logic. The system proposed there is an inclusive logic as it is, and a straightforward extension of it is also free. (shrink)

We expose the main ideas, concepts and results about Jaśkowski's discussive logic, and apply that logic to the concept of pragmatic truth and to the Dalla Chiara-di Francia view of the foundations of physics.

We expose the main ideas, concepts and results about Jakowski's discussive logic, and apply that logic to the concept of pragmatic truth and to the Dalla Chiara-di Francia view of the foundations of physics.

Jaśkowski [3] presented a new propositional calculus labeled “discussive propositional calculus”, to serve as an underlying basis for inconsistent but non-trivial theories. This system was later extended to lower andhigher order predicate calculus . Jaśkowski’s system of discussiveor discursive propositional calculus can actually be extended to predicatecalculus in at least two ways. We have the intention using this calculus ofbuilding later as a basis for a discussive theory of sets. One way is thatstudied by Da Costa and Dubikajtis. (...) Another one is developed in this paperas a solution to a problem formulated by Da Costa. In this work we study afirst order discussive predicate calculus J∗∗.The paper consists of three parts. In the first part we introduce thecalculus J∗∗ and, following Prof. D. Makinson’s suggestion, we show that itis not identical with the predicate calculus [2] of Da Costa and Dubikajtis.An axiomatization of J∗∗ is presented. In the second one, we introduce newdiscussive connectives and study some of the properties. We observe thatthe usual Kripke semantics can be adapted to the calculus J∗∗. (shrink)

In Jaśkowski’s model of discussion, discussive connectives represent certain interactions that can hold between debaters. However, it is not possible within the model for participants to use explicit modal operators. In the paper we present a modal extension of the discussive logic $\textbf{D}_{\textbf{2}}$ that formally corresponds to an extended version of Jaśkowski’s model of discussion that permits such a use. This logic is denoted by $\textbf{m}\textbf{D}_{\textbf{2}}$. We present philosophical motivations for the formulation of this logic. We also give (...) syntactic characterizations of the logic and propose a comparison with certain other modal systems. In particular, we prove that $\textbf{m}\textbf{D}_{\textbf{2}}$ is neither normal nor regular. On the basis of the axiomatization of $\textbf{D}_{\textbf{2}}$, we give an axiomatization of $\textbf{m}\textbf{D}_{\textbf{2}}$. We also give another axiomatization which is not based on the axiomatization of $\textbf{D}_{\textbf{2}}$. Furthermore, we give a natural Kripke-style semantics for $\textbf{m}\textbf{D}_{\textbf{2}}$ and prove the respective adequacy theorems. (shrink)

In 1995 N. C. A. da Costa and F. Doria proposed the modaltype elegant axiomatization of Jaśkowski’s discussive logic D2. Yet his ownproblem which was formulated in 1975 in a following way: Is it possible toformulate natural and simple axiomatization for D2, employing classical disjunction and conjunction along with discussive implication and conjunctionas the only primitive connectives? — still seems left open. The matter of factis there are some axiomatizations of D2 proposed, e.g., by T. Furmanowski, J. Kotas and (...) N. C. A. da Costa , G. Achtelik, L. Dubikajtus,E. Dudek and J. Konior , satisfying da Costa’s conditions, but they arerather looking very complicated and unnatural. An attempt is made to solveda Costa’s problem. The new axiomatization of D2 is proposed essentiallybased on da Costa’s-Doria axiomatization from 1995. (shrink)

Jaśkowski's discussive (discursive) logic D2 is historically one of the first paraconsistent logics, i.e., logics which 'tolerate' contradictions. Following Jaśkowski's idea to define his discussive logic by means of the modal logic S5 via special translation functions between discussive and modal languages, and supporting at the same time the tradition of paracomplete logics being the counterpart of paraconsistent ones, we present a paracomplete discussive logic D2p.

Classical logic, intuitionism, relevant logics and many other systems try to express implication as an entailment. The Jaskowski system Qf describes implication in connection with causality. Syntactic properties of Qf have been examined by Pieczkowski [4], [5]. The semantic characterization of Qf is the aim of this paper.

Jaśkowski’s discussive logic D2 was formulated with the help of the modal logic S5 as follows (see [7, 8]): \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${A \in {D_{2}}}$$\end{document} iff \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\rm S}5}$$\end{document}, where (–)• is a translation of discussive formulae from Ford into the modal language. We say that a modal logic L defines D2 iff \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm D}_{2} (...) = \{A \in {\rm For^{\rm d}} : \ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\it L}\}}$$\end{document}. In [14] and [10] were respectively presented the weakest normal and the weakest regular logic which (†): have the same theses beginning with ‘\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\diamond}$$\end{document}’ as S5. Of course, all logics fulfilling the above condition, define D2. In [10] it was prowed that in the cases of logics closed under congruence the following holds: defining D2 is equivalent to having the property (†). In this paper we show that this equivalence holds also for all modal logics which are closed under replacement of tautological equivalents (rte-logics).We give a general method which, for any class of modal logics determined by a set of joint axioms and rules, generates in the given class the weakest logic having the property (†). Thus, for the class of all modal logics we obtain the weakest modal logic which owns this property. On the other hand, applying the method to various classes of modal logics: rte-logics, congruential, monotonic, regular and normal, we obtain the weakest in a given class logic defining D2. (shrink)

Gentzen’s and Jaśkowski’s formulations of natural deduction are logically equivalent in the normal sense of those words. However, Gentzen’s formulation more straightforwardly lends itself both to a normalization theorem and to a theory of “meaning” for connectives . The present paper investigates cases where Jaskowski’s formulation seems better suited. These cases range from the phenomenology and epistemology of proof construction to the ways to incorporate novel logical connectives into the language. We close with a demonstration of this latter aspect (...) by considering a Sheffer function for intuitionistic logic. (shrink)

Considering the growing need for formal counterparts of causal nexus (AI is desperately looking for a good one!) and thus trying to construct appropriate relations within a formal framework one faces the problem that the notion of “causal connection” is by no means explained with sufficient precision. How to overcome the resulting difficulties?

Jaśkowski’s discussive logic D2 was formulated with the help of the modal logic S5 as follows (see [7, 8]): \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${A \in {D_{2}}}$$\end{document} iff \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\rm S}5}$$\end{document}, where (–)• is a translation of discussive formulae from Ford into the modal language. We say that a modal logic L defines D2 iff \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm D}_{2} (...) = \{A \in {\rm For^{\rm d}} : \ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\it L}\}}$$\end{document}. In [14] and [10] were respectively presented the weakest normal and the weakest regular logic which (†): have the same theses beginning with ‘\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\diamond}$$\end{document}’ as S5. Of course, all logics fulfilling the above condition, define D2. In [10] it was prowed that in the cases of logics closed under congruence the following holds: defining D2 is equivalent to having the property (†). In this paper we show that this equivalence holds also for all modal logics which are closed under replacement of tautological equivalents (rte-logics).We give a general method which, for any class of modal logics determined by a set of joint axioms and rules, generates in the given class the weakest logic having the property (†). Thus, for the class of all modal logics we obtain the weakest modal logic which owns this property. On the other hand, applying the method to various classes of modal logics: rte-logics, congruential, monotonic, regular and normal, we obtain the weakest in a given class logic defining D2. (shrink)

In this paper, I present the modal adaptive logic $AJ^{r}$ (based on S5) as well as the discussive logic $D_{2}^{r}$ that is defined from it. $D_{2}^{r}$ is a (nonmonotonic) alternative for Jaśkowski's paraconsistent system D₂. Like D₂, $D_{2}^{r}$ validates all single-premise rules of Classical Logic. However, for formulas that behave consistently, $D_{2}^{r}$ moreover validates all multiple-premise rules of Classical Logic. Importantly, and unlike in the case of D₂, this does not require the introduction of discussive connectives. It is argued (...) that this has clear advantages with respect to one of the main application contexts of discussive logics, namely the interpretation of discussions. (shrink)

In 1934 Stanisław Jaśkowski published his groundbreaking work on natural deduction. At the same year Gerhard Gentzen also published a work on the same topic. We aim at presenting of Jaśkowski’s system and provide a comparison with Gentzen’s approach. We also try to outline the influence of Jaśkowski’s approach on the later development of natural deduction systems.

We present a paraconsistent logic, called Z, based on an intuitive possible worlds semantics, in which the replacement theorem holds. We show how to axiomatize this logic and prove the completeness theorem.

Part 1 describes Stanisaw Jakowski's concept of defining some often used con ditionals, namely, factorial, ewfficient and definitive implications.Part 2 contains the results strictly connected with the theory of the above implications.

Visual targets which follow a prime stimulus and a mask can be identified faster when they are incompatible rather than compatible with the prime . According to the self-inhibition hypothesis, the initial activation of the motor response is elicited by the prime based on its identity. This activation leads to benefits for compatible trials and costs for incompatible trials. This motor activation is followed by an inhibition phase, leading to an NCE if perceptual evidence of the prime is immediately removed (...) by the mask. The object-updating and mask-triggered inhibition hypotheses emphasize the role of the mask content . We show that the NCE may appear even if nonmasking neutral flankers are presented instead of a mask. Moreover, although with target-like flankers the NCE is larger, it occurred if flankers and targets are built from dissimilar elements. Therefore, masks/flankers can evoke an inhibition phase independently of whether or not they remove evidence for the prime and whether they are similar to the targets. (shrink)

Choice reaction times to visual stimuli may be influenced by preceding subliminal stimuli . Some authors reported a straight priming effect i.e., responses were faster when primes and targets called for the same response than when they called for different responses. Others found the reversed pattern of results. Eimer and Schlaghecken [Eimer, M. & Schlaghecken, F. . Links between conscious awareness and response inhibition: evidence from masked priming. Psychonomic Bulletin & Review, 9, 514–520.] showed recently that straight priming occurs whenever (...) a prime is not efficiently masked thereby the information provided by the prime is accessible for consciousness. In the present study, a hypothesis is tested that straight priming is due to mediation of consciousness. To test this hypothesis, prime validity was manipulated. We showed that even when no mask was used so that participants could fully and consciously perceive the prime and participants were informed that primes were mostly invalid, for the short prime–target ISI interval straight priming occurred. The priming was inverse when the ISI was 800 ms. This indicates that participants were able to use the information provided by the prime to prepare the response opposite to that cued by the prime but only if the time between the prime and the target was long enough. (shrink)