X-1991-19: UNSPECIFIED (1991) Papers presented at the Provability Interpretability Arithmetic Conference, 24-31 Aug. 1991, Dept. of Phil., Utrecht University. [Report]
X-1991-06: UNSPECIFIED (1991) Annual Report 1990. [Report]
CT-1991-12: Apt, Krzysztof R. and Pedreschi, Dino (1991) Reasoning about Termination of Prolog Programs. [Report]
X-1991-09: Beklemishev, L.D. (1991) On Bimodal Provability Logics for P1-axiomatized Extensions of Arithmetical Theories. [Report]
ML-1991-02: Berarducci, Alessandro and Verbrugge, Rineke (1991) On the Metamathematics of Weak Theories. [Report]
ML-1991-06: Bethke, Inge (1991) Finite Type Structures within Combinatory Algebras. [Report]
ML-1991-08: Bethke, Inge (1991) Going Stable in Graph Models. [Report]
X-1991-18: Cepparello, Giovanna (1991) New Semantics for Predicate Modal Logic: an Analysis from a standard point of view. [Report]
X-1991-01: Chagrov, Alexander and Zakharyaschev, Michael (1991) The Disjunction Property of Intermediate Propositional Logics. [Report]
X-1991-02: Chagrov, Alexander and Zakharyaschev, Michael (1991) On the Undecidability of the Disjunction Property of Intermediate Propositional Logics. [Report]
CT-1991-08: Doets, Kees (1991) Levationis Laus. [Report]
X-1991-08: Dzhaparidze, Giorgie (1991) Logic of Tolerance. [Report]
LP-1991-03: Groeneveld, Willem (1991) Dynamic Semantics and Circular Propositions (superseded by X-1992-03). [Report]
CT-1991-11: Hemachandra, Lane A. and Spaan, Edith (1991) Quasi-Injective Reductions. [Report]
X-1991-12: Hendriks, Herman (1991) Flexibele Categoriale Syntaxis en Semantiek: de proefschriften van Frans Zwarts en Michael Moortgat. [Report]
ML-1991-04: Hoofman, Raymond and Schellinx, Harold (1991) Collapsing Graph Models by Preorders. [Report]
LP-1991-06: Huang, Zhisheng and van Emde Boas, Peter (1991) Belief Dependence, Revision and Persistence. [Report]
LP-1991-05: Huang, Zhisheng and van Emde Boas, Peter (1991) The Schoenmakers Paradox: Its Solution in a Belief Dependence Framework. [Report]
X-1991-04: Ignatiev, K.N. (1991) Partial Conservativity and Modal Logics. [Report]
LP-1991-04: Kanazawa, Makoto (1991) The Lambek Calculus enriched with Additional Connectives. [Report]
X-1991-16: Kanovei, V.G. (1991) Undecidable Hypotheses in Edward Nelson's Internal Set Theory. [Report]
X-1991-14: Kanovich, Max I. (1991) The Horn Fragment of Linear Logic is NP-Complete. [Report]
X-1991-13: Kanovich, Max I. (1991) The Multiplicative Fragment of Linear Logic is NP-Complete. [Report]
CT-1991-07: Kwast, Karen L. (1991) The Incomplete Database. [Report]
CT-1991-02: Li, Ming and Tromp, John and Vitányi, Paul M.B. (1991) How to Share Concurrent Wait-Free Variables. [Report]
CT-1991-03: Li, Ming and Vitányi, Paul M.B. (1991) Average Case Complexity under the Universal Distribution Equals Worst Case Complexity. [Report]
CT-1991-09: Li, Ming and Vitányi, Paul M.B. (1991) Combinatorial Properties of Finite Sequences with high Kolmogorov Complexity. [Report]
CT-1991-01: Li, Ming and Vitányi, Paul M.B. (1991) Kolmogorov Complexity Arguments in Combinatorics. [Report]
LP-1991-09: Nieuwendijk, Arthur (1991) Semantics and Comparative Logic. [Report]
CL-1991-03: Prüst, Hub and Scha, Remko and den Berg, Martin van (1991) A Formal Discourse Grammar tackling Verb Phrase Anaphora. [Report]
CL-1991-01: Scholtes, J.C. (1991) Kohonen Feature Maps in Natural Language Processing. [Report]
CL-1991-02: Scholtes, J.C. (1991) Neural Nets and their Relevance for Information Retrieval. [Report]
X-1991-15: Shavrukov, V. Yu. (1991) Subalgebras of Diagonalizable Algebras of Theories containing Arithmetic (revised version of X-1991-03). [Report]
X-1991-03: Shavrukov, V. Yu. (1991) Subalgebras of Diagonalizable Algebras of Theories containing Arithmetic (superseded by X-1991-15). [Report]
ML-1991-09: Shavrukov, V.Yu. (1991) A Note on the Diagonalizable Algebras of PA and ZF. [Report]
CT-1991-06: Spaan, Edith (1991) Census Techniques on Relativized Space Classes. [Report]
ML-1991-05: Troelstra, A.S. (1991) History of Constructivism in the Twentieth Century. [Report]
X-1991-07: Troelstra, A.S. (1991) Lectures on Linear Logic, Errata and Supplement. [Report]
CT-1991-10: Tromp, John and Vitányi, Paul (1991) A Randomized Algorithm for Two-Process Wait-Free Test-and-Set. [Report]
LP-1991-08: Valencia, Víctor Sánchez (1991) Categorial Grammar and Natural Reasoning. [Report]
LP-1991-02: Veltman, Frank (1991) Defaults in Update Semantics. [Report]
ML-1991-01: Venema, Yde (1991) Cylindric Modal Logic. [Report]
ML-1991-07: Venema, Yde (1991) Modal Derivation Rules. [Report]
ML-1991-11: Verbrugge, Rineke (1991) Feasible Interpretability. [Report]
LP-1991-07: Verkuyl, Henk and der Does, Jaap van (1991) The Semantics of Plural Noun Phrases. [Report]
X-1991-11: Zakharyaschev, Michael (1991) Canonical Formulas for K4. Part I: Basic Results. [Report]
ML-1991-03: Zambella, Domenico (1991) On the Proofs of Arithmetical Completeness for Interpretability Logic. [Report]
ML-1991-10: de Rijke, Maarten and Venema, Yde (1991) Sahlqvist's Theorem for Boolean Algebras with Operators. [Report]
LP-1991-01: der Hoek, Wiebe van and de Rijke, Maarten (1991) Generalized Quantifiers and Modal Logic. [Report]
LP-1991-10: van Benthem, Johan (1991) Logic and the Flow of Information. [Report]
ML-1991-12: van Benthem, Johan (1991) Modal Frame Classes, revisited. [Report]
X-1991-05: van Benthem, Johan (1991) Temporal Logic. [Report]
CT-1991-04: van Denneheuvel, Sieger and Kwast, Karen (1991) Weak Equivalence. [Report]
CT-1991-05: van Denneheuvel, Sieger and Kwast, Karen (1991) Weak Equivalence for Constraint Sets. [Report]
X-1991-17: van Lambalgen, Michiel (1991) Independence, Randomness and the Axiom of Choice (Revised Version of X-1991-10). [Report]
X-1991-10: van Lambalgen, Michiel (1991) Independence, Randomness and the Axiom of Choice (superseded by X-1991-17). [Report]
![[up]](/style/images/multi_up.png)
Up a level