In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s logic both with one (...) (A. Urquhart, G. Priest, A. Tamminga) and two designated values (G. Priest, B. Kooi, A. Tamminga). The purpose of this paper is to provide natural deduction systems for weak and intermediate regular logics both with one and two designated values. (shrink)

In the paper, we tackle the matter of non-classical logics, in particular, paraconsistent ones, for which not every formula follows in general from inconsistent premisses. Our benchmark is Jaśkowski’s logic, modeled with the help of discussion. The second key origin of this paper is the matter of being tabular, i.e. being adequately expressible by finitely many finite matrices. We analyse Jaśkowski’s non-tabular discussive (discursive) logic $ \textbf {D}_{2}$, one of the first paraconsistent logics, from the perspective of a trivalent tabular (...) logic. We are motivated to step down from the ongoing modal $ \textbf {S5}$-perspective of developing $ \textbf {D}_{2}$ both by certain mysteries that have been surrounding it and by gaps in Jaśkowski’s arguments contra the multivalent tabular perspective. Although Jaśkowski’s idea to use $ \textbf {S5}$ in order to define $ \textbf {D}_{2}$ is very attractive since it allows one to benefit from the tools and results of modal logic, it also gives a ‘non-direct’ formulation and, as it appeared later, is superfluous with respect to what is meant to be achieved since one can define the very same logic but using modal logics weaker than S5. It is also known, due to Kotas, that discussive logic is not finite-valued. So, in light of Kotas’s result that $ \textbf {D}_{2}$ is non-tabular, we propose to associate it with a few dozen discussive formulae that Jaśkowski unequivocally and illustratively suggests to be its theorems or non-theorems rather than with axioms of its modern axiomatizations (one of which Kotas employs) in order to be capable of performing a computer-aided brute-force search for suitable trivalent matrices in the cases of one and two designated values. As a result, we find trivalent matrices with two designated values that might be dubbed ‘discussive’ because they meet Jaśkowski’s suggestion to validate and invalidate the litmus theorems and non-theorems, respectively, despite the fact that none of them validates all the negation axioms in the modern axiomatizations of $ \textbf {D}_{2}$. The matrices found are then analysed along with highlighting the ones that were previously mentioned in the literature. We conclude the paper with a comparative analysis of Omori’s results and a test of Karpenko’s hypothesis. (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.

In an article “Countering a Counter-intuitive Probability” [4], Lynn E. Rose discusses a question in conditional probability, claiming that the following problem posed by Copi [1] is usually incorrectly solved:Remove all cards except aces and kings from a deck, so that only eight cards remain, of which four are aces and four are kings. From this abbreviated deck, deal two cards to a friend. If he looks at his cards and announces that his hand contains an ace, what is the (...) probability that both his cards are aces? If he announces instead that one of his cards is the ace of spades, what is the probability then that both his cards are aces? (shrink)

We give several new characterizations of the continuous enumeration degrees. The main one proves that an enumeration degree is continuous if and only if it is not half a nontrivial relativized K-pair. This leads to a structural dichotomy in the enumeration degrees.

A large team of well-known Soviet scholars is currently preparing a new textbook in philosophy. We thought it might be useful to acquaint the broad philosophical public with the ideas that guided the authors in writing the textbook, and have included its table of contents, preface, and conclusion. We also, together with the team of authors, are hoping for readers' responses. The book will be published shortly by Politizdat Publishers.

Preoccupation with LTP as a putative memory mechanism may have retarded the consideration of pathological modulation of synaptic plasticity in clinical disorders where memory dysfunction is not a primary feature. Encouraged by Shors & Matzel's review, we consider the relationship between stress, synaptic plasticity, and depressive disorder.

Despite the many meanings of the term "myth" and the diversity of its definitions, "it is usually assumed that a myth is a story, an invention, a fantasy" [2, p. 13], that is, an inadequate reflection of reality. Myths arise when there is either a deficit of information or a surplus, when someone is interested in concealing the truth and replacing it with falsehood. Anything can be the object of a myth, from the neighbor's salary to the future of an (...) individual country, but usually it is something important for the bulk of society. Social structures, not only secret but also fully "open" ones such as science, can be overgrown with myths. (shrink)