default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 36
Volume 36, Number 1, 1990
- Kazem Taghva:
Model completeness and direct power. 3-9 - V. Michele Abrusci:
A comparison between lambek syntactic calculus and intuitionistic linear propositional logic. 11-15 - L. M. Doorman:
A note on the existence property for intuitionistic logic with function symbols. 17-21 - Wieslaw Szwast:
On the generator problem. 23-27 - Jan Krajícek, Pavel Pudlák:
Quantified propositional calculi and fragments of bounded arithmetic. 29-46 - Alessandra Carbone
, Franco Montagna:
Much shorter proofs: A bimodal investigation. 47-66 - Giangiacomo Gerla, Roberto Tortora:
Fuzzy natural deduction. 67-77 - Michal Krynicki:
Quantifiers determined by partial orderings. 79-86 - Daniel Abraham Romano:
A theorem on cocongruence of rings. 87-88
Volume 36, Number 2, 1990
- Leopoldo E. Bertossi:
The formal language Lt and topological products. 89-94 - Igor Urbas:
On subsystems of the system J1 of Arruda and Da Costa. 95-106 - Helmut Pfeiffer:
A theorem on labelled trees and the limits of its provability. 107-122 - Mai Gehrke, Matt Insall, Klaus Kaiser:
Some nonstandard methods applied to distributive lattices. 123-131 - Akihiro Kanamori, Tamara Awerbuch-Friedlander:
The compleat 0†. 133-141 - Cristian Calude, Lila Santean:
On a theorem of Günter Asser. 143-147 - Andrzej Orlicki:
Some remarks on ω-powers of enumerated sets and their applications to ω-operations. 149-161 - Michael Deutsch:
Eine Bemerkung zu spektralen Darstellungen von ϱ-stelligen aufzählbaren und koaufzählbaren Prädikaten durch Ausdrücke aus ∃∀∃∞ und ∀∃2∀(∞, 1). 163-184
Volume 36, Number 3, 1990
- Martin K. Solomon:
Relativized Gödel speed-up and the degree of succinctness of representations. 185-192 - Silvio Ghilardi, Giancarlo Meloni:
Modal logics with n-ary connectives. 193-215 - Pierre Ille:
Cloture intervallaire et extension logique d'une relation. 217-227 - Wojciech Sachwanowicz:
A note on complete partitions in boolean algebras. 229-232 - Dev Kumar Roy:
Effective extensions of partial orders. 233-236 - Hajime Ishihara:
An omniscience principle, the König Lemma and the Hahn-Banach theorem. 237-240 - Hirokazu Nishimura:
On the absoluteness of types in boolean valued lattices. 241-246 - Ahmed K. Khalifa:
A constructive version of Sperner's lemma and Brouwer's fixed point theorem. 247-251 - Tryggvi Edwald:
The t-variable method in gentzen-style automatic theorem proving. 253-261 - Angel V. Ditchev:
Some results on bounded truth-table degrees. 263-271 - Zvonimir Sikic:
Premiss tree proofs and logic of contradiction. 273-280
Volume 36, Number 4, 1990
- Carlos G. González:
The union axiom in zermelo set theory. 281-284 - Michael A. Ingrassia, Steffen Lempp:
Jumps of nontrivial splittings of recursively enumerable sets. 285-292 - Carlos A. Di Prisco, Mark Fuller, James M. Henle:
The normal depth of filters on an infinite cardinal. 293-296 - V. Michele Abrusci:
Non-commutative intuitionistic linear logic. 297-318 - Maurizio Negri:
Fixed points and diagonal method. 319-329 - Dumitru Busneag:
ƒ-Multipliers and the localization of hilbert algebras. 331-338 - Michael Deutsch:
Weitere Verschärfungen zu den Reduktionstypen ∀∃∞∀(0, 1), ∃∞∀3∃(∞, 1). 339-355 - Noriya Kadota, Kiwamu Aoyama:
Some extensions of built-upness on systems of fundamental sequences. 357-364 - Nobu-Yuki Suzuki:
An extension of ono's completeness result. 365-366 - Pascal Ostermann:
Many-valued modal logics: Uses and predicate calculus. 367-376
Volume 36, Number 5, 1990
- Adam Krawczyk, Marian Srebrny:
Measurability and the baire property at higher levels. 377-380 - George Weaver, Michael Thau, Hugues Leblanc:
Extending ω-consistent sets to maximally consistent, ω-complete sets. 381-383 - Thomas Forster:
Permutations and stratified formulae a preservation theorem. 385-388 - Ruy J. G. B. de Queiroz, T. S. E. Maibaum:
Proof theory and computer programming. 389-414 - Andrzej Zbrzezny:
The hilbert type axiomatization of some three-valued propositional logic. 415-421 - Teodor Stepien:
Minimal systems. 423-430 - Wojcech Sachwanowicz:
Boolean powers over incomplete boolean algebras. 431-440 - Henryk Kotlarski, Zygmunt Ratajczyk:
More on induction in the language with a satisfaction class. 441-454 - Rüdiger Schätz:
Formalizing falsification: Three delete operations. 455-470 - Hirokazu Nishimura:
Some connections between boolean valued analysis and topological reduction theory for C*-algebras. 471-479
Volume 36, Number 6, 1990
- Kazuyuki Tanaka:
Weak axioms of determinacy and subsystems of analysis I: δ. 481-491 - A. Clivio:
Algorithmic aspects of Z[x1, ..., xn] with applications to tiling problems. 493-515 - George F. Schumm:
The number of {□, →}-logics. 517-518 - Roland Hinnion:
Stratified and positive comprehension seen as superclass rules over ordinary set theory. 519-534 - Josep Maria Font, Gonzalo Rodríguez:
Note on algebraic models for relevance logic. 535-540 - Andrzej Orlicki:
On some categories of partial enumerated sets. 541-560 - August Plattner:
Zusammenhang zwischen der Theorie F der Faktorenimplikation und der Theorie der Zylinderalgebren, Reduktion der Vollständigkeit der Axiome von F. 561-572 - Michel Hébert:
Corrections to "preservation and interpolation through binary relations between theories". 573
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
