9 found
Maarten de Rijke [5]Maarten Rijke [4]
  1.  28
    Sahlqvist's Theorem for Boolean Algebras with Operators with an Application to Cylindric Algebras.Maarten De Rijke & Yde Venema - 1995 - Studia Logica 54 (1):61 - 78.
    For an arbitrary similarity type of Boolean Algebras with Operators we define a class of Sahlqvist identities. Sahlqvist identities have two important properties. First, a Sahlqvist identity is valid in a complex algebra if and only if the underlying relational atom structure satisfies a first-order condition which can be effectively read off from the syntactic form of the identity. Second, and as a consequence of the first property, Sahlqvist identities are canonical, that is, their validity is preserved under taking canonical (...)
    Direct download (4 more)  
    Export citation  
    Bookmark   10 citations  
  2.  31
    Generalized quantifiers and modal logic.Wiebe Hoek & Maarten Rijke - 1993 - Journal of Logic, Language and Information 2 (1):19-58.
    We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness both of modal systems (...)
    Direct download (3 more)  
    Export citation  
    Bookmark   8 citations  
  3.  34
    The logic of Peirce algebras.Maarten Rijke - 1995 - Journal of Logic, Language and Information 4 (3):227-250.
    Peirce algebras combine sets, relations and various operations linking the two in a unifying setting. This paper offers a modal perspective on Peirce algebras. Using modal logic as a characterization of the full Peirce algebras is given, as well as a finite axiomatization of their equational theory that uses so-called unorthodox derivation rules. In addition, the expressive power of Peirce algebras is analyzed through their connection with first-order logic and the fragment of first-order logic corresponding to Peirce algebras is described (...)
    Direct download (4 more)  
    Export citation  
    Bookmark   4 citations  
  4.  23
    The Modal Logic of Inequality.Maarten De Rijke - 1992 - Journal of Symbolic Logic 57 (2):566 - 584.
    We consider some modal languages with a modal operator D whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.
    Direct download (3 more)  
    Export citation  
    Bookmark   20 citations  
  5.  2
    Editors' Introduction.Patrick Blackburn & Maarten de Rijke - 1996 - Notre Dame Journal of Formal Logic 37 (2):161-166.
  6.  7
    A Note on the Expressive Power of Probabilistic Context Free Grammars.Gabriel Infante-Lopez & Maarten Rijke - 2006 - Journal of Logic, Language and Information 15 (3):219-231.
    We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering out unwanted parses. Probabilities in PCFGs induce an ordering relation among the set of trees that yield a given input sentence. PCFG parsers return the trees bearing the maximum probability for a given sentence, discarding all other possible trees. This mechanism is naturally viewed as a way of defining a new class of (...)
    Direct download  
    Export citation  
  7.  51
    A note on the interpretability logic of finitely axiomatized theories.Maarten Rijke - 1991 - Studia Logica 50 (2):241 - 250.
    In [6] Albert Visser shows that ILP completely axiomatizes all schemata about provability and relative interpretability that are provable in finitely axiomatized theories. In this paper we introduce a system called ILP that completely axiomatizes the arithmetically valid principles of provability in and interpretability over such theories. To prove the arithmetical completeness of ILP we use a suitable kind of tail models; as a byproduct we obtain a somewhat modified proof of Visser's completeness result.
    Direct download (5 more)  
    Export citation  
  8.  20
    A Note on Graded Modal Logic.Maarten De Rijke - 2000 - Studia Logica 64 (2):271 - 283.
    We introduce a notion of bisimulation for graded modal logic. Using this notion, the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property and proving invariance and definability results.
    Direct download (2 more)  
    Export citation  
    Bookmark   5 citations  
  9.  31
    Jon Barwise and Jerry Seligman. Information flow. The logic of distributed systems. Cambridge tracts in theoretical computer science, no. 44. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, xv + 274 pp. [REVIEW]Maarten De Rijke - 1999 - Journal of Symbolic Logic 64 (4):1836-1836.