• Every computation can be viewed as a graph that satisfies monadic second-order formula. recursively enumerable relation computed by such For this notion of computability, graphs need not coded strings or numbers. A binary on is if and only it formula logic. The latter means the defines set graphs, in usual way, each “computation graph” determines pair consisting an input output graph.

Abstract Truth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature this We offer series formal results in support thesis that disquotational truth device simulate higher-order resources first-order setting. More specifically, we show any theory formulated language can naturally and conservat...