Abstract We prove that the first-order logic of CZF is intuitionistic logic. To do so, we introduce a new model transfinite computation (Set Register Machines) and combine resulting notion realisability with Beth semantics. On way, also show propositional admissible rules are exactly those

After Büchi it has become very natural to interprete formulae of certain logical theories as finite automata, i.e., as recognizing devices. This recognition aspect though, was neglected by the inventor of the concept and the study of the families of linear structures that could be accepted in the language theory sense of the term, was carried out by other authors. The most popular field of appl...

In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains which are decomposable into smaller similar blocks that are properly coupled. The RBHM is built upon the reduced basis element method (RBEM) an...