Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 38
Volume 38, Number 1, 1992
- Pawel Pazdyka:
The Preservation of submodel Relation by Taking Primitive Models. 3-19 - Roman Kossak, Henryk Kotlarski:
Game Approximations of Satisfaction Classes Models. 21-26 - Gérard Lopez, Claire Rauzy:
Reconstruction of Binary Relations from their Restrictions of Cardinality 2, 3, 4 and (n - 1) I. 27-37 - Silvio Valentini:
The Judgement Calculus for Intuitionistic Linear Logic: Proof Theory and Semantics. 39-58 - Roman Murawski:
Iterations of Satisfaction Classes and Models of Peano Arithmetic. 59-84 - Robert A. Bull:
Cut Elimination for Propositional Dynamic Logic without. 85-100 - Akito Tsuboi:
On Definability of Normal Subgroups of a Superstable Group. 101-106 - Andrea Cantini:
Levels of Implication and Type Free Theories of Classifications with Approximation Operator. 107-141 - Franco Parlamento, Alberto Policriti:
The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation. 143-156 - Gérard Lopez, Claire Rauzy:
Reconstruction of Binary Relations from their Restrictions of Cardinality 2, 3, 4 and (n - 1) II. 157-168 - Cristian S. Calude, Gabriel Istrate, Marius Zimand:
Recursive Baire Classification and Speedable Functions. 169-178 - Kosta Dosen:
A Brief Survey of Frames for the Lambek Calculus. 179-187 - Kyriakos Kontostathis:
Topological Framework for Finite Injury. 189-195 - Mingsheng Ying
:
The Fundamental Theorem of Ultraproduct in Pavelka's Logic. 197-201 - Grzegorz Michalski:
On the Iterated ω-Rule. 203-208 - Zhi-Wei Sun:
Anew Relation-Combining Theorem and its Application. 209-212 - Anne Preller:
An Interpretation of Martin-LöF's Constructive Theory of Types in Elementary Topos Theory. 213-240 - Radosav S. Dordevic:
Analytic Completeness Theorem for absolutely Continuous Biprobability Models. 241-246 - Fabio Bellissima, Alessandra Ciupi:
On the Inadequacy of the Relational Semantic for the "Until" Operator. 247-252 - Maurizio Negri:
Universal Functions in Partial Structures. 253-268 - Yungchen Cheng, Paula Kemp:
Representation of Posets. 269-276 - Antonio Greco:
A Class of Models for Skala's Set Theory. 277-282 - Cyprien Gnanvo, Pierre Ille:
La Reconstruction des tournois sans Diamant. 283-291 - Gregory L. McColm:
Some Ramsey Theory in Boolean Algebra for Complexity Classes. 293-298 - Andrei A. Kuzichev:
The Ambiguous Type Theory is Hereditarily Undecidable. 299-300 - Kazuyuki Tanaka:
A Game-Theoretic Proof of analytic Ramsey Theorem. 301-304 - Qin Jun:
An Elementary System as and its Semi-Completeness and Decidability. 305-320 - Dolph Ulrich:
On the Incompleteness of a Descending Chain of Extensions of Implicational S5. 321-323 - Martin Weese:
A Direct Proof of a Result of Shelah. 325-326 - Burghard Herrmann, Wolfgang Rautenberg:
Finite Replacement and Finite Hilbert-Style Axiomatizability. 327-344 - Victor Pambuccian:
Ternary Operations as Primitive Notions for Plane Geometry II. 345-348 - Caterina Bianchini, Andrea Sorbi:
Reducibility in Some Categories of Partial Recursive Operators. 349-359 - Gabriel Sandu, Jouko Väänänen:
Partially Ordered Connectives. 361-372 - Klaus Schumacher:
Boolean Algebras in AST. 373-382 - Bernhard Banaschewski:
Algebraic Closure without Choice. 383-385 - Karl-Heinz Diener:
On the Transitive Hull of a κ-Narrow Relation. 387-398 - Tapani Hyttinen:
On Non-Determined Ehrenfeucht-FRAïSSé Games and unstable Theories. 399-408 - Branislav R. Boricic:
On Some Interpretations of Classical Logic. 409-412 - Piotr Koszmider:
A Formalism for Some Class of Forcing Notions. 413-421 - Karol Habart:
Bounds in the Turing Reducibility of Functions. 423-430 - Helmut Pfeiffer:
A Notation System for Ordinal Using ψ-Functions on Inaccessible Mahlo numbers. 431-456 - Jean Guillaume Hagendorf:
Restriction Respectueuse et Reconstruction des chaines et des Relations Infinites. 457-490 - Geir Waagbø:
Quantified Modal Logic with Neighborhood Semantics. 491-499 - Wojciech Zielonka:
Interdefinability of Lambekian Functors. 501-507 - Barbara Klunder:
Topos Based Semantic for Constructive Logic with Strong Negation. 509-519 - Mingsheng Ying:
Compactness, the LöWenheim-Skolem Property and the Direct Product of Lattices of Truth Values. 521-524 - Frederick Bagemihl:
Ordinal numbers in Arithmetic Progression. 525-528 - Norbert Brunner, Paul E. Howard:
Russell's Alternative to the Axiom of Choice. 529-534 - Paolo Gentilini:
Provability Logic in the Gentzen Formulation of Arithmetic. 535-550 - Takao Inoué:
Flagg and Friedman's Translation is not Faithful. 551-554 - Eric Schechter:
Two Topological Equivalents of the Axiom of Choice. 555-557 - Michael Deutsch:
Ein neuer Beweis und eine Verschärfung für den Reduktionstyp ∀∃∀∞(0, 1) mit einer Anwendung auf die spektrale Darstellung von Prädikaten. 559-574 - Andrey A. Kuzichev:
Elimination of Quantifiers over Vectors in Some Theories of Vector Spaces. 575-577
a service of 
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-04-25 04:43 CEST 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:
