Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
This paper presents a formalisation of the steamboiler problem using Circus, a unified theory of the formal specification languages Z and CSP. The aim of Circus is to provide powe...
Abstract— We propose in this paper a generalization of percolation processes in Z2 using the pretopology theory. We formalize the notion of neighborhood by extending it to the co...