T be a first-order theory, i.e. a set of closed formulas in a first-order language L. A closed predicate formula is called T-valid if each its closed L-instance is in T. We denote the set of T-valid predicate formulas by L(T) and call it the predicate logic of the theory T." /> Arithmetic complexity of the predicate logics of complete arithmetic theories - Plisko Valeri | sdvig press

Arithmetic complexity of the predicate logics of complete arithmetic theories

Valeri Plisko

pp. 57-66

Full Text
Download
Other Editions

Text

This document is unfortunately not available for download at the moment.

Not implemented yet !