- Maurizio Negri:
Fixed points and diagonal method. Math. Log. Q. 36(4): 319-329 (1990) - Hirokazu Nishimura:
On the absoluteness of types in boolean valued lattices. Math. Log. Q. 36(3): 241-246 (1990) - Hirokazu Nishimura:
Some connections between boolean valued analysis and topological reduction theory for C*-algebras. Math. Log. Q. 36(5): 471-479 (1990) - Andrzej Orlicki:
Some remarks on ω-powers of enumerated sets and their applications to ω-operations. Math. Log. Q. 36(2): 149-161 (1990) - Andrzej Orlicki:
On some categories of partial enumerated sets. Math. Log. Q. 36(6): 541-560 (1990) - Pascal Ostermann:
Many-valued modal logics: Uses and predicate calculus. Math. Log. Q. 36(4): 367-376 (1990) - Helmut Pfeiffer:
A theorem on labelled trees and the limits of its provability. Math. Log. Q. 36(2): 107-122 (1990) - August Plattner:
Zusammenhang zwischen der Theorie F der Faktorenimplikation und der Theorie der Zylinderalgebren, Reduktion der Vollständigkeit der Axiome von F. Math. Log. Q. 36(6): 561-572 (1990) - Carlos A. Di Prisco, M. Fuller, James M. Henle:
The normal depth of filters on an infinite cardinal. Math. Log. Q. 36(4): 293-296 (1990) - Ruy J. G. B. de Queiroz, T. S. E. Maibaum:
Proof theory and computer programming. Math. Log. Q. 36(5): 389-414 (1990) - Daniel Abraham Romano:
A theorem on cocongruence of rings. Math. Log. Q. 36(1): 87-88 (1990) - Dev Kumar Roy:
Effective extensions of partial orders. Math. Log. Q. 36(3): 233-236 (1990) - Wojciech Sachwanowicz:
A note on complete partitions in boolean algebras. Math. Log. Q. 36(3): 229-232 (1990) - Wojcech Sachwanowicz:
Boolean powers over incomplete boolean algebras. Math. Log. Q. 36(5): 431-440 (1990) - Rüdiger Schätz:
Formalizing falsification: Three delete operations. Math. Log. Q. 36(5): 455-470 (1990) - George F. Schumm:
The number of {□, →}-logics. Math. Log. Q. 36(6): 517-518 (1990) - Zvonimir Sikic:
Premiss tree proofs and logic of contradiction. Math. Log. Q. 36(3): 273-280 (1990) - Martin K. Solomon:
Relativized Gödel speed-up and the degree of succinctness of representations. Math. Log. Q. 36(3): 185-192 (1990) - Teodor Stepien:
Minimal systems. Math. Log. Q. 36(5): 423-430 (1990) - Nobu-Yuki Suzuki:
An extension of ono's completeness result. Math. Log. Q. 36(4): 365-366 (1990) - Wieslaw Szwast:
On the generator problem. Math. Log. Q. 36(1): 23-27 (1990) - Kazem Taghva:
Model completeness and direct power. Math. Log. Q. 36(1): 3-9 (1990) - Kazuyuki Tanaka:
Weak axioms of determinacy and subsystems of analysis I: δ. Math. Log. Q. 36(6): 481-491 (1990) - Igor Urbas:
On subsystems of the system J1 of Arruda and Da Costa. Math. Log. Q. 36(2): 95-106 (1990) - George Weaver, Michael Thau, Hugues Leblanc:
Extending ω-consistent sets to maximally consistent, ω-complete sets. Math. Log. Q. 36(5): 381-383 (1990) - Andrzej Zbrzezny:
The hilbert type axiomatization of some three-valued propositional logic. Math. Log. Q. 36(5): 415-421 (1990)