ILLC Publications, All Series, 1991

These reports are also available from the UvA/DARE server: the page corresponding to the listing below can be found here.


Coding for publications: Series-Year-Number, with DS = Dissertation Series; MoL = Master of Logic Thesis; PP = Prepublication Series (since 1999); X = Technical Notes; CL = Computational Linguistics (up to 1993); CT = Computation and Complexity Theory (up to 1998); LP = Logic, Philosophy and Linguistics (up to 1998); ML = Mathematical Logic and Foundations (up to 1998); ITLI = Instituut voor Taal, Logika en Informatie (up to 1987);

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

The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X