Publicaties
Gekozen filters:
Gekozen filters:
The polytopologies of transfinite provability logic Universiteit Gent
Provability logics are modal or polymodal systems designed for modeling the behavior of Godel's provability predicate and its natural extensions. If I > is any ordinal, the Godel-Lob calculus GLP (I >) contains one modality [lambda] for each lambda < I >, representing provability predicates of increasing strength. GLP (omega) has no non-trivial Kripke frames, but it is sound and complete for its topological semantics, as was shown by ...
Non-commutative logic for compositional distributional semantics Vrije Universiteit Brussel
Distributional models of natural language use vectors to provide a contextual foundation for meaning representation. These models rely on large quantities of real data, such as corpora of documents, and have found applications in natural language tasks, such as word similarity, disambiguation, indexing, and search. Compositional distributional models extend the distributional ones from words to phrases and sentences. Logical operators are ...
Non-finite axiomatizability of dynamic topological logic Universiteit Gent
A purely syntactic and cut-free sequent calculus for the modal logic of provability Vrije Universiteit Brussel
In this paper we present a sequent calculus for the modal propositional logic GL (the
logic of provability) obtained by means of the tree-hypersequent method, a method in which the
metalinguistic strength of hypersequents is improved, so that we can simulate trees-shapes. We
prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL,
that it is contraction-free and cut-free and that ...
logic of provability) obtained by means of the tree-hypersequent method, a method in which the
metalinguistic strength of hypersequents is improved, so that we can simulate trees-shapes. We
prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL,
that it is contraction-free and cut-free and that ...
Extending two-variable logic on data trees with order on data values and its automata Universiteit Hasselt
Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value from an infinite domain. They have been used as an abstraction model for reasoning tasks on XML and verification. However, most existing approaches consider the case where only equality test can be performed on the data values. In this paper we study data trees in which the data values come from a linearly ordered domain, and in ...
GIS based landslide susceptibility mapping using a fuzzy logic approach: A case study from Ghurmi-Dhad Khola area, Eastern Nepal Vrije Universiteit Brussel
Landslides cause extensive loss of life and property in the Nepal Himalaya. Since the late 1980s, different mathematical models have been developed and applied for landslide susceptibility mapping and hazard assessment in Nepal. The main goal of this paper is to apply fuzzy logic to landslide susceptibility mapping in the Ghurmi-Dhad Khola area, Eastern Nepal. Seven causative factors are considered: slope angle, slope aspect, distance from ...
A cut-free and contraction free sequent calculus for propositional dynamic logic Vrije Universiteit Brussel
In this paper we present a sequent calculus for propositional dynamic logic
built using an enriched version of the tree-hypersequent method and including an infini-
tary rule for the iteration operator. We prove that this sequent calculus is theoremwise
equivalent to the corresponding Hilbert-style system, and that it is contraction-free and
cut-free. All results are proved in a purely syntactic way.
built using an enriched version of the tree-hypersequent method and including an infini-
tary rule for the iteration operator. We prove that this sequent calculus is theoremwise
equivalent to the corresponding Hilbert-style system, and that it is contraction-free and
cut-free. All results are proved in a purely syntactic way.
Logic in the tradition of Prabhacandra Universiteit Gent
The characterization of truth-preserving arguments is a core issue in India and received the detailed attention of philosophers. This chapter presents Prabhācandra’s theory of inference from the eleventh century, stressing its uniqueness and detailed critique of Dignāga and Dharmakīrti. In Prabhācandra’s framework, the inferential evidence has not three but just one characteristic, “being impossible otherwise.” The epistemological problem of the ...
Recovering quantum logic within an extended classical framework Vrije Universiteit Brussel
We present a procedure which allows us to recover classical and nonclassical logical structures as \emph{concrete logics} associated with physical theories expressed by means of classical languages. This procedure consists in choosing, for a given theory $\mathcal T$ and classical language $\mathcal L$ expressing $\mathcal T$, an observative sublanguage $L$ of $\mathcal L$ with a notion of truth as correspondence, introducing in $L$ a derived ...