Yes, the logical operators for FOL are defined exactly as they are in PL. For example, in both logics, if p and q are propositions, or formulas (FOL calls propositions formulas" or well-formed formulas"), then p & q is a formula and is true when both p and q are true and is false otherwise.