Abstract
This paper is a step toward showing what is achievable using non-classical metatheory-particularly, a substructural paraconsistent framework. What standard results, or analogues thereof, from the classical metatheory of first order logic(s) can be obtained? We reconstruct some of the originals proofs for Completeness, Lowenheim-Skolem and Compactness theorems in the context of a substructural logic with the naive comprehension schema. The main result is that paraconsistent metatheory can 're-capture' versions of standard theorems, given suitable restrictions and background assumptions; but the shift to non-classical logic may recast the meanings of these apparently 'absolute' theorems.