BULLETIN OF THE SECTION OF LOGIC
Author Index

To find any word: author, title or key word; please, press "Ctrl-F".

D

DAHN, Bernd
Generalized Kripke models
3-7     3/1
A note on generalized Kripke models
8-12     3/1
Neighbourhood semantics and generalized Kripke semantics
2-8     5/1
DARDZANIA, G.K.
Intuitionistic system without contraction
2-8     6/1
DARMOCHWAL, Agata
PC Mizar presentation
92-93     20/3-4
DELLUNDE i CLAVE, Pilar
A finitary 1-equivalential logic not finitely equivalential
120-122     24/3
de MORAES, Lafayette
On discussive set theory
144-149     14/4
DEMRI, Stephane
Extensions of modal logic S5 preserving NP-completeness
73-84     26/2
DEMRI, Stephane and Orlowska, Ewa
A class of modal logics with a finite model property with respect to the set of M-formulae
39-49     26/1
DENECKE, K. and Sarasit N.
Products of Tree Languages
13-36     40/1-2
de QUEIROZ Ruy J. G. B. and Haroldo G. Benatti
Descriptive Complexity of Modularity Problems on Graphs
61-76     34/2
On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs
195-214     35/4
DESCALCO, L. and Manuel, A. Martins
On the Injectivity of the Leibniz Operator
203-212     34/4
DIAS, Matias F.
The reals in D*
89     7/2
DIENER, Karl-Heinz
On the natural order relation in Peano algebras with finitary or infinitary operations
127-134     22/3
DIETRICH, Jens
CL-monoids of 1-place propositional connectives
138-145     22/4
Star-connectives in propositional logics
2-11     23/1
DJANKOV, Bogdan
Editorial introduction
108-110     13/3
Polysemantic structure and semantic closedness of natural languages
188-198     13/3
DORIA F.A. and N.C.A.da Costa
On the existence of very difficult satisfiability problems
122-133     21/4
Incomplete satisfiability problems
150-157     22/4
On Set Theory as a Foundation for Computer Science
33-40     33/1
DOSEN, Kosta
Higher-order sequent-systems for intuitionistic modal logic
140-143     14/4
Normal modal logics in which the Heyting propositional calculus can be embedded
23-33     17/1
Cut elimination in adjunction
61-74     28/2
dos SANTOS, Luis Henrique Lopes
Discussive versions of the modal calculi T, B, S4 and S5
92     7/2
DRAGALIN, Albert G.
The collapse of the descriptive complexity of truth definitions.
Completions of Heyting and Boolean algebras
94-95     20/3-4
On foundations of mathematics: some modern problems and achievements
23-25     27/1-2
DUNN, J. Michael
Incompleteness of the bibinary semantics for R
107-110     16/3
DUNTSCH, Ivo and Orlowska, Ewa
Mixing modal and sufficiency operators
99-106     28/2
DYRDA, Kazimiera
Some remarks on WMV-algebras
55-63     12/2
On simple algebras in Ens
25-30     13/1
On classification of commutative BCK-logics
30-33     14/1
DYRDA, Kazimiera and Janicka-Zuk Irena
Axiomatization of the logics determined by finite relational systems of natural numbers with identity
152-155     27/4
DYRDA, Kazimiera and Prucnal, Tadeusz
On finitely based consequence determined by a distributive lattice
60-66     9/2
DYWAN, Zdzislaw
Dual counterparts of strongly finite consequences
75     7/2
Decidability of structural completeness for strongly finite propositional calculi
129-132   7/3
Finite structural axiomatization of every finite-valued propositional calculus
61-67     8/2
Quasi-strongly finite sentential calculi
154-158   9/2
The necessity of modal logic S5 is metalogical
162-169     10/4
An interpretation of Aristotle's syllogistic
and a certain fragment of set theory in propositional calculi
85-91     13/2
On Lemmon's interpretation of the connective of necessity
92-98     13/2
An interpretation of a certain fragment of arithmetic in some propositional calculus
99-105     13/2
On a certain method of producing logical matrices
2-7     14/1
A new variant of the Goedel-Malcev theorem for the classical propositional calculus
8-14     14/1
On some method of axiomatization of some propositional calculi
52-59     15/2
DYRDA, Kazimiera and Stepien, Teodor
Every two-valued propositional calculus has the interpolation property
152-153     9/4
DZIK, Wojciech
Unitary Unification of S5 Modal Logic and its Extensions
19-26     32/1-2
Transparent Unifiers in Modal Logics with Self-Conjugate Operators
73-84     35/2-3
Remarks o Projective Unifierns
37-46     40/1-2
DZIK, Wojciech, and Roman Suszko
On distributivity of closure systems
64-66     6/2
DZIOBIAK, Wieslaw
Classically axiomatizable modal propositional calculi
containing the system T of Feys-von Wright
20-24     5/1
Semantics of Kripke's style for some modal systems
63-67   5/2
A note on incompleteness of modal logics with respect to neighbourhood semantics
185-190     7/4
An example concerning the lattice of the structural consequence operations
48-53   8/2
On strongly finite consequence operations
87-94     8/2
An example of strongly finite consequence operation with 2ω standard strengthenings
95-98     8/2
A variety generated by a finite algebra with 2ω subvarieties
2-9     9/1
The degrees of maximality of the intuitionistic propositional logic
and of some of its fragments
136-140     9/3
On matrices characteristic of relevant logics
113-115     10/3
Non-existence of a countable strongly adequate matrix semantics for neighbours of E
170-176     10/4
Concerning axiomatizability of the quasivariety
generated by a finite Heyting or topological Boolean algebra
177-180     10/4
There are 2ω logics with the relevance principle between R and RM
161-168    11/3-4
Quasivariety generated by a finite Sugihara structure has finitely many subquasivarieties
27-31     12/1
Structural completeness of modal logics containing K4
32-36     12/1
On distributivity of the lattice of subquasivarieties of a variety of Heyting algebra
37-40     12/1
DZIOBIAK, Wieslaw and Sachwanowicz, Wojciech
On two notions concerning the structural sentential calculi
54-60     8/2

BULLETIN OF THE SECTION OF LOGIC