TOPICS
Search

Search Results for ""


221 - 230 of 895 for Symbolic ComputingSearch Results
A sentence is called a contingency if its truth table contains at least one 'T' and at least one 'F.'
A sentence is called a contradiction if its truth table contains only false entries.
One of the basic objects treated in a given formal language system. The term is sometimes also used as a synonym for urelement.
Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...
A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.
An expression which is a sentence or which contains variables and becomes a sentence upon appropriate substitutions for these variables (Carnap 1958, p. 24). Sentential ...
A sentential variable, also called a propositional variable, that can be substituted for in arbitrary sentential formulas (Carnap 1958, p. 24).
A property of individuals which is shared by every individual.
The quantifier "for all" ( forall ), sometimes also known as the "general quantifier."
A universal sentence is a sentence (i.e., formula of the predicate calculus without free variables) whose variables are universally quantified.
1 ... 20|21|22|23|24|25|26 ... 90 Previous Next

...