Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
We propose a framework for performing extensional and intensional temporal reasoning about qualitative and quantitative “periodicity-dependent” temporal constraints between rep...
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...