<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE LexicalResource SYSTEM "http://globalwordnet.github.io/schemas/WN-LMF-relaxed-1.4.dtd">
<LexicalResource xmlns:dc="https://globalwordnet.github.io/schemas/dc/">
  <Lexicon id="oewn" label="Open English Wordnet" language="en" email="english-wordnet@googlegroups.com" license="https://creativecommons.org/licenses/by/4.0" version="2024" url="https://github.com/globalwordnet/english-wordnet">
    <LexicalEntry id="oewn-formal_system-n">
      <Lemma writtenForm="formal system" partOfSpeech="n"/>
      <Sense id="oewn-formal_system-n-92447050-n" synset="oewn-92447050-n" dc:identifier="formal_system%1:09:01::"/>
    </LexicalEntry>
    <Synset id="oewn-92447050-n" ili="in" partOfSpeech="n" members="oewn-formal_system-n" lexfile="noun.cognition">
      <Definition language="en">(logic and mathematics) abstract, theoretical organization of terms and implicit relationships that is used as a tool for the analysis of the concept of deduction.</Definition>
      <SynsetRelation relType="hypernym" target="oewn-05734541-n"/>
      <SynsetRelation relType="hyponym" target="oewn-92447049-n"/>
      <Example language="en">A formal system is said to be recursive (i.e. effective) if the set of axioms and the set of inference rules are decidable sets or semidecidable sets, according to context.</Example>
    </Synset>
  </Lexicon>
</LexicalResource>