general recursive set
121Ontology language — In computer science and artificial intelligence, ontology languages are formal languages used to construct ontologies. They allow the encoding of knowledge about specific domains and often include reasoning rules that support the processing of… …
122Modal operator — In modal logic, a modal operator is an operator which forms propositions from propositions. In general, a modal operator has the formal property of being non truth functional, and is intuitively characterised by expressing a modal attitude (such… …
123Monadic predicate calculus — In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… …
124Argument — This article is about the subject as it is studied in logic and philosophy. For other uses, see Argument (disambiguation). In philosophy and logic, an argument is an attempt to persuade someone of something, by giving reasons or evidence for… …
125Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… …
126Description — For other uses, see Description (disambiguation). Description is one of four rhetorical modes (also known as modes of discourse), along with exposition, argumentation, and narration. Each of the rhetorical modes is present in a variety of forms… …
127Logical truth — is one of the most fundamental concepts in logic, and there are different theories on its nature. A logical truth is a statement which is true and remains true under all reinterpretations of its components other than its logical constants. It is… …
128Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… …
