In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Abstract--Higher order fuzzy logic systems (FLSs), such as interval type-2 FLSs, have been shown to be very well suited to deal with the high levels of uncertainties present in the...
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...