In linguistics and mathematics, the phenomenon of negative concord presents a challenge for analysis using the methods of formal semantics, particularly when relying on the principle of compositionality. For the Russian language, we propose a potential solution for formalizing sentences with negative concord. This solution involves a linguistic pre-processing of the sentences, followed by the application of a mathematical tool: Skolem functions. This paper presents an algorithm for the linguistic pre-processing of Russian sentences with canonical word order (subject-verb-object) and discusses how Skolem functions can be applied to formally represent negative concord. This approach allows for a more precise analysis and formalization of the semantic structure of certain linguistic phenomena in the Russian language.