
Authors:
Magdalena FABISIAK
Title:The Logic K of Strict Implication and its Relatives
Pages:191196
File:bibtex
Abstract ( + )
The logics of strict implication are usually defined on the standard propositional language L = (L, &, or, >, ~) in which the sign ``>" is interpreted as a connective of strict implication. At times, in order to formulate only essential properties of pure strict implication and to avoid some possible influence or even distortion from the other connectives, a purely implicational language L = (L,>) seems to be more appropriate. In this paper I am going to consider three logics of strict implication defined on such a language. The main aim of the paper is to provide a set of axioms adequate for the logic of strict implication corresponding to modal logic K. Moreover, the paper contains some new sets of axioms for the logics T and S4 of strict implication, obtained rather nonstandard method  without application of Lindenbaum lemma.

Authors:
Szymon FRANKOWSKI
Title:pConsequence Versus qConsequence Operations
Pages:197207
File:bibtex
Abstract ( + )
Among different generalisations of the ordinary propositional consequence operation at last the following two are a special interest: the socalled quasiconsequence (qconsequence) and plausible consequence (pconsequence) operations. The paper shows the special kind of symetry between two classes of operations and takes advantage of syntactic apparatus employed for pconsequences to characterize qconsequences.

Authors:
Malgorzata SERWECINSKA
Title:Communication Complexity in Linearly Ordered Sets
Pages:209222
File:bibtex
Abstract ( + )
In this paper we consider a communication complexity of the minimum function defined over a linear ordered set. We construct a protocol, the cost of which give an upper bound on the deterministic communication complexity. A lower bound will be derived from the rank lower bound. It seems, that the presented protocol is almost optimal for large sets. Its simply modification give an upper bound on the average communication complexity of the minimum function.

Authors:
Janusz CIUCIURA
Title:Labelled Tableaux for D_{2}
Pages:223235
File:bibtex
Abstract ( + )
In the late forties, Stanislaw Jaskowski published his wellknow papers on the discursive sentential calculus, D_{2}. He provided a definition of it by an interpretation in the language of S_{5} of Lewis. However, it is the sisyphean labour to transform any discursive formula into its modal counterpart. The inconvenience results in the search for a new simple tool we could use trying to answer the question whether a discursive formula is valid in D_{2} or it is not. We intend to introduce a more efficient method that makes the translation procedure redundant, present a direct semantics and (Signed and Unsigned) Labelled Tableaux for D_{2}.

Authors:
Norihiro KAMIDE
Title:A Relationship Between Rauszer's HB Logic and Nelson's Logic
Pages:237249
File:bibtex
Abstract ( + )
A relationship between Rauszer's HB logic and Nelson's logic is clarified using some sequent calculus based translations.