In this paper we use set theory to describe FOL systems. This restatement of the notions implicit in First Order Logic facilitates their interpretation as finite data structures. This is a crucial step toward the goal of building an artificial reasoner. This paper is dedicated to Professor Takasu for his dedication to science and his recognition that logic is important both for program correctness and theories of reasoning.
Keywords: first-order logic, FOL context, partial structure, FOL system, representation, reasoning