- Full text PDF available (63)
- This year (3)
- Last 5 years (15)
- Last 10 years (38)
Journals and Conferences
Acknowledgments I am truly grateful to my two advisers, Jeroen Groenendijk and Dick de Jongh, without whom (needless to say, though I'll say it anyway) this thesis wouldn't have existed. I was fortunate enough to meet Jeroen early on in my days at the ILLC and to have established such a fruitful collaboration; Jeroen is an inspiring teacher and an inspired… (More)
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz, Pearce and Valverde, 2001). In this paper we will… (More)
We extend Angluin s theorem to char acterize identi ability of indexed families of r e languages as opposed to indexed families of recursive languages We also prove some variants characterizing conservativity and two other similar restrictions paralleling Zeug mann Lange and Kapur s results for indexed families of recursive languages
This thesis is mainly concerned with the definability issue when modal logic is interpreted on topological spaces. A topological analogon of Goldblatt-Thomason theorem is proved. Some new topological constructions are introduced. One of them, namely the notion of compact extension, is a generalization of the concept of Stone-Čech compactification known in… (More)
We investigate fragments of intuitionistic propositional logic containing implication but not disjunction. These fragments are finite, but their size grows superexponentially with the number of generators. Exact models are used to characterize the fragments.
This article is a report on research in progress into the structure of finite diagrams of intuitionistic propositional logic with the aid of automated reasoning systems for larger calculations. Afragment of a propositional logic is the set of formulae built up from a finite number of propositional variables by means of a number of connectives of the logic,… (More)
This paper contains a completeness proof for the system ILW, a rather bewildering axiom system belonging to the family of interpretability logics. We have treasured this little proof for a considerable time, keeping it just for ourselves. Johan’s fiftieth birthday appears to be the right occasion to get it out of our wine cellar.