Search Results for ""

A sentential formula that contains at least one free variable (Carnap 1958, p. 24). A sentential variable containing no free variables (i.e., all variables are bound) is ...

Resolution is a widely used word with many different meanings. It can refer to resolution of equations, resolution of singularities (in algebraic geometry), resolution of ...

A truth table is a two-dimensional array with n+1 columns. The first n columns correspond to the possible values of n inputs, and the last column to the operation being ...

Consider expressions built up from variables and constants using function symbols. If v_1, ..., v_n are variables and t_1, ..., t_n are expressions, then a set of mappings ...

In predicate calculus, a universal formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...

The term used in propositional calculus for the NAND connective. The notation A|B is used for this connective, a most unfortunate choice in light of modern usage of A|B or ...

A man of Seville is shaved by the Barber of Seville iff the man does not shave himself. Does the barber shave himself? This pseudoparadox was proposed by Bertrand Russell.

Consider a library which compiles a bibliographic catalog of all (and only those) catalogs which do not list themselves. Then does the library's catalog list itself?

A conclusion is a statement arrived at by applying a set of logical rules known as syllogisms to a set of premises. The process of drawing conclusions from premises and ...

The formal term in propositional calculus for the connective implies.