Interpretability logics are endowed with relational semantics \`a la Kripke: Veltman semantics. F... more Interpretability logics are endowed with relational semantics \`a la Kripke: Veltman semantics. For certain applications though, this semantics is not fine-grained enough. Back in 1992, in the research group of de Jongh, the notion of generalised Veltman semantics emerged to obtain certain non-derivability results as was first presented by Verbrugge ([76]). It has turned out that this semantics has various good properties. In particular, in many cases completeness proofs become simpler and the richer semantics will allow for filtration arguments as opposed to regular Veltman semantics. This paper aims to give an overview of results and applications of Generalised Veltman semantics up to the current date.
Interpretability logics are endowed with relational semantics a la Kripke: Veltman semantics. For... more Interpretability logics are endowed with relational semantics a la Kripke: Veltman semantics. For certain applications though, this semantics is not fine-grained enough. Back in 1992, in the research group of de Jongh, the notion of generalised Veltman semantics emerged to obtain certain non-derivability results as was first presented by Verbrugge ([76]). It has turned out that this semantics has various good properties. In particular, in many cases completeness proofs become simpler and the richer semantics will allow for filtration arguments as opposed to regular Veltman semantics. This paper aims to give an overview of results and applications of Generalised Veltman semantics up to the current date.
Expliquem els detalls d'un analitzador automatic de programes Haskell. L'analitzador es c... more Expliquem els detalls d'un analitzador automatic de programes Haskell. L'analitzador es capac de detectar recursivitat en les definicions d'un programa, transformar definicions per tal de millorar-ne l'eficiencia mentre se'n mante la semantica i verificar la terminacio en alguns casos.
We present Phileas, an automatic theorem prover focused on structural induction. Phileas is capab... more We present Phileas, an automatic theorem prover focused on structural induction. Phileas is capable of automatically proving properties about inductively defined data types in Haskell anb reporting a proof in a human readable format.
Interpretability logics are endowed with relational semantics \`a la Kripke: Veltman semantics. F... more Interpretability logics are endowed with relational semantics \`a la Kripke: Veltman semantics. For certain applications though, this semantics is not fine-grained enough. Back in 1992, in the research group of de Jongh, the notion of generalised Veltman semantics emerged to obtain certain non-derivability results as was first presented by Verbrugge ([76]). It has turned out that this semantics has various good properties. In particular, in many cases completeness proofs become simpler and the richer semantics will allow for filtration arguments as opposed to regular Veltman semantics. This paper aims to give an overview of results and applications of Generalised Veltman semantics up to the current date.
Interpretability logics are endowed with relational semantics a la Kripke: Veltman semantics. For... more Interpretability logics are endowed with relational semantics a la Kripke: Veltman semantics. For certain applications though, this semantics is not fine-grained enough. Back in 1992, in the research group of de Jongh, the notion of generalised Veltman semantics emerged to obtain certain non-derivability results as was first presented by Verbrugge ([76]). It has turned out that this semantics has various good properties. In particular, in many cases completeness proofs become simpler and the richer semantics will allow for filtration arguments as opposed to regular Veltman semantics. This paper aims to give an overview of results and applications of Generalised Veltman semantics up to the current date.
Expliquem els detalls d'un analitzador automatic de programes Haskell. L'analitzador es c... more Expliquem els detalls d'un analitzador automatic de programes Haskell. L'analitzador es capac de detectar recursivitat en les definicions d'un programa, transformar definicions per tal de millorar-ne l'eficiencia mentre se'n mante la semantica i verificar la terminacio en alguns casos.
We present Phileas, an automatic theorem prover focused on structural induction. Phileas is capab... more We present Phileas, an automatic theorem prover focused on structural induction. Phileas is capable of automatically proving properties about inductively defined data types in Haskell anb reporting a proof in a human readable format.
Uploads
Papers by Jan Mas Rovira